Roberto Cordone

Orcid: 0000-0002-5439-1743

According to our database1, Roberto Cordone authored at least 74 papers between 2001 and 2024.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

On csauthors.net:

Bibliography

2024
On the completeness of several fortification-interdiction games in the Polynomial Hierarchy.
CoRR, 2024

A Revisited Branch and Bound Method for the Weighted Safe Set Problem.
Proceedings of the 13th International Conference on Operations Research and Enterprise Systems, 2024

2023
Constructive-destructive heuristics for the Safe Set Problem.
Comput. Oper. Res., November, 2023

A combinatorial branch and bound for the safe set problem.
Networks, June, 2023

2022
Supervisory Control of Timed Discrete-Event Systems With Logical and Temporal Specifications.
IEEE Trans. Autom. Control., 2022

Maximum feasible subsystems of distance geometry constraints.
J. Glob. Optim., 2022

Cardinality constrained connected balanced partitions of trees under different criteria.
Discret. Optim., 2022

2021
On finding connected balanced partitions of trees.
Discret. Appl. Math., 2021

Metaheuristics for the Minimum Gap Graph Partitioning Problem.
Comput. Oper. Res., 2021

2019
14th Cologne-Twente Workshop on Graphs and CombinatorialOptimization (CTW 2016).
Discret. Appl. Math., 2019

A bi-objective model for the single-machine scheduling problem with rejection cost and total tardiness minimization.
Comput. Oper. Res., 2019

2018
Toward Smart Building Design Automation: Extensible CAD Framework for Indoor Localization Systems Deployment.
IEEE Trans. Comput. Aided Des. Integr. Circuits Syst., 2018

A Branch-and-Bound Algorithm for the Prize-Collecting Single-Machine Scheduling Problem with Deadlines and Total Tardiness Minimization.
INFORMS J. Comput., 2018

2017
On edge-aware path-based color spatial sampling for Retinex: from Termite Retinex to Light Energy-driven Termite Retinex.
J. Electronic Imaging, 2017

2016
The Prize-collecting Scheduling Problem with Deadlines.
Electron. Notes Discret. Math., 2016

Multimode extensions of Combinatorial Optimization problems.
Electron. Notes Discret. Math., 2016

Preface.
Electron. Notes Discret. Math., 2016

Partitioning a graph into minimum gap components.
Electron. Notes Discret. Math., 2016

The multimode covering location problem.
Comput. Oper. Res., 2016

Preemption-aware planning on big-data systems.
Proceedings of the 21st ACM SIGPLAN Symposium on Principles and Practice of Parallel Programming, 2016

Floor plan design and automatic nodes deployment for indoor location and monitoring systems.
Proceedings of the 2016 ACM International Joint Conference on Pervasive and Ubiquitous Computing and Proceedings of the 2016 ACM International Symposium on Wearable Computers, 2016

2015
A variable neighborhood search algorithm for the multimode set covering problem.
J. Glob. Optim., 2015

Construction and improvement algorithms for dispersion problems.
Eur. J. Oper. Res., 2015

A branch and bound approach for the design of decentralized supervisors in Petri net models.
Autom., 2015

2014
Column-generation based bounds for the Homogeneous Areas Problem.
Eur. J. Oper. Res., 2014

Optimal selection of contracts and work shifts in multi-skill call centers.
EURO J. Comput. Optim., 2014

Employee workload balancing by graph partitioning.
Discret. Appl. Math., 2014

Balanced compact clustering for efficient range queries in metric spaces.
Discret. Appl. Math., 2014

Decentralized Monitors Design for Petri Net Models.
Proceedings of the 12th International Workshop on Discrete Event Systems, 2014

2013
Parsimonious Monitor Control of Petri Net Models of Flexible Manufacturing Systems.
IEEE Trans. Syst. Man Cybern. Syst., 2013

Designing Optimal Deadlock Avoidance Policies for Sequential Resource Allocation Systems Through Classification Theory: Existence Results and Customized Algorithms.
IEEE Trans. Autom. Control., 2013

An integer optimization approach for reverse engineering of gene regulatory networks.
Discret. Appl. Math., 2013

A GRASP metaheuristic for microarray data analysis.
Comput. Oper. Res., 2013

Integrated design of optimal supervisors for the enforcement of static and behavioral specifications in Petri net models.
Autom., 2013

Compact supervisors for general constraint enforcement in Petri net models with uncontrollable transitions.
Proceedings of the 12th European Control Conference, 2013

Compact and decentralized supervisors for general constraint enforcement in Petri net models.
Proceedings of the 52nd IEEE Conference on Decision and Control, 2013

Parsimonious deadlock-free Petri net models of flexible manufacturing systems.
Proceedings of the American Control Conference, 2013

2012
Solving the Quadratic Minimum Spanning Tree Problem.
Appl. Math. Comput., 2012

Upper and Lower Bounds for the Homogeneous Areas Problem.
Proceedings of the 11th Cologne-Twente Workshop on Graphs and Combinatorial Optimization, 2012

Maximally permissive deadlock avoidance for sequential resource allocation systems using disjunctions of linear classifiers.
Proceedings of the 51th IEEE Conference on Decision and Control, 2012

2011
Comparing local search metaheuristics for the maximum diversity problem.
J. Oper. Res. Soc., 2011

A Lagrangian Relaxation Approach for Gene Regulatory Networks.
Proceedings of the 10th Cologne-Twente Workshop on graphs and combinatorial optimization. Extended Abstracts, 2011

Monitor optimization in Petri net control.
Proceedings of the IEEE Conference on Automation Science and Engineering, 2011

2010
Optimization Algorithms for the Max Edge Weighted Clique Problem with Multiple Choice Constraints.
Proceedings of the 9th Cologne-Twente Workshop on Graphs and Combinatorial Optimization, 2010

A reachability graph partitioning technique for the analysis of deadlock prevention methods in bounded Petri nets.
Proceedings of the American Control Conference, 2010

2009
Combined Siphon and Marking Generation for Deadlock Prevention in Petri Nets.
IEEE Trans. Syst. Man Cybern. Part A, 2009

Partitioning and Scheduling of Task Graphs on Partially Dynamically Reconfigurable FPGAs.
IEEE Trans. Comput. Aided Des. Integr. Circuits Syst., 2009

Bounds and Solutions for Strategic, Tactical and Operational Ambulance Location.
Proceedings of the 8th Cologne-Twente Workshop on Graphs and Combinatorial Optimization, 2009

Balanced Clustering for Efficient Detection of Scientific Plagiarism.
Proceedings of the 8th Cologne-Twente Workshop on Graphs and Combinatorial Optimization, 2009

Efficient deadlock prevention in Petri nets through the generation of selected siphons.
Proceedings of the American Control Conference, 2009

2008
Selective Siphon Control for Deadlock Prevention in Petri Nets.
IEEE Trans. Syst. Man Cybern. Part A, 2008

The optimization of kEP-SOPs: Computational complexity, approximability and experiments.
ACM Trans. Design Autom. Electr. Syst., 2008

Solving the swath segment selection problem through Lagrangean relaxation.
Comput. Oper. Res., 2008

A Relax-and-Cut Algorithm for the Knapsack Node Weighted Steiner Tree Problem.
Asia Pac. J. Oper. Res., 2008

Tabu Search versus GRASP for the maximum diversity problem.
4OR, 2008

On Projecting Sums of Products.
Proceedings of the 11th Euromicro Conference on Digital System Design: Architectures, 2008

Heuristic and exact approaches to the Quadratic Minimum Spanning Tree Problem.
Proceedings of the Seventh Cologne Twente Workshop on Graphs and Combinatorial Optimization, 2008

A Modified Algorithm for Perceived Contrast Measure in Digital Images.
Proceedings of the 4th European Conference on Colour in Graphics, 2008

2007
A subexponential algorithm for the coloured tree partition problem.
Discret. Appl. Math., 2007

An approximation algorithm for fully testable kEP-SOP networks.
Proceedings of the 17th ACM Great Lakes Symposium on VLSI 2007, 2007

Non redundant siphon control in ordinary petri nets.
Proceedings of the 46th IEEE Conference on Decision and Control, 2007

2006
An exact algorithm for the node weighted Steiner tree problem.
4OR, 2006

Logic Synthesis of EXOR Projected Sum of Products.
Proceedings of the VLSI-SoC: Research Trends in VLSI and Systems on Chip, 2006

EXOR Projected Sum of Products.
Proceedings of the IFIP VLSI-SoC 2006, 2006

Using speculative computation and parallelizing techniques to improve scheduling of control based designs.
Proceedings of the 2006 Conference on Asia South Pacific Design Automation: ASP-DAC 2006, 2006

2005
Enumeration algorithms for minimal siphons in Petri nets based on place constraints.
IEEE Trans. Syst. Man Cybern. Part A, 2005

2004
The demand-dependent optimization of regular train timetables.
Electron. Notes Discret. Math., 2004

The Multicommodity Multilevel Bottleneck Assignment Problem.
Electron. Notes Discret. Math., 2004

On the complexity of graph tree partition problems.
Discret. Appl. Math., 2004

2003
A heuristic approach to the overnight security service problem.
Comput. Oper. Res., 2003

Some results on the computation of minimal siphons in Petri nets.
Proceedings of the 42nd IEEE Conference on Decision and Control, 2003

2001
An efficient heuristic approach to solve the unate covering problem.
IEEE Trans. Comput. Aided Des. Integr. Circuits Syst., 2001

A Heuristic for the Vehicle Routing Problem with Time Windows.
J. Heuristics, 2001

Coloured Ant System and Local Search to Design Local Telecommunication Networks.
Proceedings of the Applications of Evolutionary Computing, 2001


  Loading...