Остановите войну!
for scientists:
default search action
Roberto Cordone
- > Home > Persons > Roberto Cordone
Publications
- 2024
- [c29]Alberto Boggio Tomasaz, Roberto Cordone:
A Revisited Branch and Bound Method for the Weighted Safe Set Problem. ICORES 2024: 113-122 - 2023
- [j47]Alberto Boggio Tomasaz, Roberto Cordone, Pierre Hosteins:
Constructive-destructive heuristics for the Safe Set Problem. Comput. Oper. Res. 159: 106311 (2023) - [j46]Alberto Boggio Tomasaz, Roberto Cordone, Pierre Hosteins:
A combinatorial branch and bound for the safe set problem. Networks 81(4): 445-464 (2023) - 2022
- [j45]Roberto Cordone, Davide Franchi, Andrea Scozzari:
Cardinality constrained connected balanced partitions of trees under different criteria. Discret. Optim. 46: 100742 (2022) - [j44]Maurizio Bruglieri, Roberto Cordone, Leo Liberti:
Maximum feasible subsystems of distance geometry constraints. J. Glob. Optim. 83(1): 29-47 (2022) - 2021
- [j42]Maurizio Bruglieri, Roberto Cordone:
Metaheuristics for the Minimum Gap Graph Partitioning Problem. Comput. Oper. Res. 132: 105301 (2021) - [j41]Maurizio Bruglieri, Roberto Cordone, Isabella Lari, Federica Ricca, Andrea Scozzari:
On finding connected balanced partitions of trees. Discret. Appl. Math. 299: 1-16 (2021) - 2019
- [j40]Roberto Cordone, Pierre Hosteins:
A bi-objective model for the single-machine scheduling problem with rejection cost and total tardiness minimization. Comput. Oper. Res. 102: 130-140 (2019) - [j39]Alberto Ceselli, Roberto Cordone:
14th Cologne-Twente Workshop on Graphs and CombinatorialOptimization (CTW 2016). Discret. Appl. Math. 253: 1 (2019) - 2018
- [j38]Roberto Cordone, Pierre Hosteins, Giovanni Righini:
A Branch-and-Bound Algorithm for the Prize-Collecting Single-Machine Scheduling Problem with Deadlines and Total Tardiness Minimization. INFORMS J. Comput. 30(1): 168-180 (2018) - [j37]Andrea Cirigliano, Roberto Cordone, Alessandro Antonio Nacci, Marco Domenico Santambrogio:
Toward Smart Building Design Automation: Extensible CAD Framework for Indoor Localization Systems Deployment. IEEE Trans. Comput. Aided Des. Integr. Circuits Syst. 37(1): 133-145 (2018) - 2016
- [j35]Fabio Colombo, Roberto Cordone, Guglielmo Lulli:
The multimode covering location problem. Comput. Oper. Res. 67: 25-33 (2016) - [j34]Alberto Ceselli, Roberto Cordone, Giovanni Righini:
Preface. Electron. Notes Discret. Math. 55: 1-3 (2016) - [j33]Roberto Cordone, Guglielmo Lulli:
Multimode extensions of Combinatorial Optimization problems. Electron. Notes Discret. Math. 55: 17-20 (2016) - [j32]Maurizio Bruglieri, Roberto Cordone:
Partitioning a graph into minimum gap components. Electron. Notes Discret. Math. 55: 33-36 (2016) - [j31]Pierre Hosteins, Roberto Cordone, Giovanni Righini:
The Prize-collecting Scheduling Problem with Deadlines. Electron. Notes Discret. Math. 55: 57-60 (2016) - [c28]Andrea Cirigliano, Alessandro Antonio Nacci, Roberto Cordone, Marco Domenico Santambrogio:
Floor plan design and automatic nodes deployment for indoor location and monitoring systems. UbiComp Adjunct 2016: 45-48 - [c27]Marco Rabozzi, Matteo Mazzucchelli, Roberto Cordone, Giovanni Matteo Fumarola, Marco D. Santambrogio:
Preemption-aware planning on big-data systems. PPoPP 2016: 48:1-48:2 - 2015
- [j29]Roberto Aringhieri, Roberto Cordone, Andrea Grosso:
Construction and improvement algorithms for dispersion problems. Eur. J. Oper. Res. 242(1): 21-33 (2015) - [j28]Fabio Colombo, Roberto Cordone, Guglielmo Lulli:
A variable neighborhood search algorithm for the multimode set covering problem. J. Glob. Optim. 63(3): 461-480 (2015) - 2014
- [j27]Alberto Ceselli, Fabio Colombo, Roberto Cordone, Marco Trubian:
Employee workload balancing by graph partitioning. Discret. Appl. Math. 165: 112-129 (2014) - [j26]Alberto Ceselli, Fabio Colombo, Roberto Cordone:
Balanced compact clustering for efficient range queries in metric spaces. Discret. Appl. Math. 169: 43-67 (2014) - [j25]Roberto Cordone, Pierre Hosteins, Giovanni Righini, Paolo Ravizza, Andrea Piselli:
Optimal selection of contracts and work shifts in multi-skill call centers. EURO J. Comput. Optim. 2(4): 247-277 (2014) - [j24]Fabio Colombo, Roberto Cordone, Marco Trubian:
Column-generation based bounds for the Homogeneous Areas Problem. Eur. J. Oper. Res. 236(2): 695-705 (2014) - 2013
- [j22]Roberto Cordone, Guglielmo Lulli:
A GRASP metaheuristic for microarray data analysis. Comput. Oper. Res. 40(12): 3108-3120 (2013) - [j21]Roberto Cordone, Guglielmo Lulli:
An integer optimization approach for reverse engineering of gene regulatory networks. Discret. Appl. Math. 161(4-5): 580-592 (2013) - 2012
- [c21]Fabio Colombo, Roberto Cordone, Marco Trubian:
Upper and Lower Bounds for the Homogeneous Areas Problem. CTW 2012: 92-95 - 2011
- [j17]Roberto Aringhieri, Roberto Cordone:
Comparing local search metaheuristics for the maximum diversity problem. J. Oper. Res. Soc. 62(2): 266-280 (2011) - [c19]Roberto Cordone, Guglielmo Lulli:
A Lagrangian Relaxation Approach for Gene Regulatory Networks. CTW 2011: 122-125 - 2010
- [c17]Alberto Ceselli, Roberto Cordone, Yari Melzani, Giovanni Righini:
Optimization Algorithms for the Max Edge Weighted Clique Problem with Multiple Choice Constraints. CTW 2010: 37-41 - 2009
- [j16]Roberto Cordone, Francesco Redaelli, Massimo Redaelli, Marco D. Santambrogio, Donatella Sciuto:
Partitioning and Scheduling of Task Graphs on Partially Dynamically Reconfigurable FPGAs. IEEE Trans. Comput. Aided Des. Integr. Circuits Syst. 28(5): 662-675 (2009) - [c15]Alberto Ceselli, Roberto Cordone, Marco Cremonini:
Balanced Clustering for Efficient Detection of Scientific Plagiarism. CTW 2009: 163-170 - [c14]Roberto Cordone, Federico Ficarelli, Giovanni Righini:
Bounds and Solutions for Strategic, Tactical and Operational Ambulance Location. CTW 2009: 180-183 - 2008
- [j14]Roberto Aringhieri, Roberto Cordone, Yari Melzani:
Tabu Search versus GRASP for the maximum diversity problem. 4OR 6(1): 45-60 (2008) - [j13]Roberto Cordone, Marco Trubian:
A Relax-and-Cut Algorithm for the Knapsack Node Weighted Steiner Tree Problem. Asia Pac. J. Oper. Res. 25(3): 373-391 (2008) - [j12]Roberto Cordone, Federico Gandellini, Giovanni Righini:
Solving the swath segment selection problem through Lagrangean relaxation. Comput. Oper. Res. 35(3): 854-862 (2008) - 2006
- [j8]Roberto Cordone, Marco Trubian:
An exact algorithm for the node weighted Steiner tree problem. 4OR 4(2): 124-144 (2006) - [c8]Roberto Cordone, Fabrizio Ferrandi, Marco D. Santambrogio, Gianluca Palermo, Donatella Sciuto:
Using speculative computation and parallelizing techniques to improve scheduling of control based designs. ASP-DAC 2006: 898-904 - 2004
- [j6]Roberto Cordone, Francesco Maffioli:
On the complexity of graph tree partition problems. Discret. Appl. Math. 134(1-3): 51-65 (2004) - [j5]Roberto Aringhieri, Roberto Cordone:
The Multicommodity Multilevel Bottleneck Assignment Problem. Electron. Notes Discret. Math. 17: 35-40 (2004) - [j4]Alessandro Chierici, Roberto Cordone, Roberto Maja:
The demand-dependent optimization of regular train timetables. Electron. Notes Discret. Math. 17: 99-104 (2004) - [c5]Roberto Aringhieri, Roberto Cordone:
The Multicommodity Multilevel Bottleneck Assignment Problem. CTW 2004: 37-40 - [c4]Alessandro Chierici, Roberto Cordone, Roberto Maja:
The Demand-dependent Optimization of Regular Train Timetables. CTW 2004: 91-95 - 2003
- [j3]Roberto Wolfler Calvo, Roberto Cordone:
A heuristic approach to the overnight security service problem. Comput. Oper. Res. 30(9): 1269-1287 (2003) - 2001
- [j2]Roberto Cordone, Roberto Wolfler Calvo:
A Heuristic for the Vehicle Routing Problem with Time Windows. J. Heuristics 7(2): 107-129 (2001) - [j1]Roberto Cordone, Fabrizio Ferrandi, Donatella Sciuto, Roberto Wolfler Calvo:
An efficient heuristic approach to solve the unate covering problem. IEEE Trans. Comput. Aided Des. Integr. Circuits Syst. 20(12): 1377-1388 (2001) - [c2]Roberto Cordone, Francesco Maffioli:
Coloured Ant System and Local Search to Design Local Telecommunication Networks. EvoWorkshops 2001: 60-69 - 2000
- [c1]Roberto Cordone, Fabrizio Ferrandi, Donatella Sciuto, Roberto Wolfler Calvo:
An Efficient Heuristic Approach to Solve the Unate Covering Problem. DATE 2000: 364-371
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from , , and to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from .
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-04-21 17:41 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint