| Publication | Date of Publication | Type |
|---|
A combinatorial branch and bound for the safe set problem
Networks | 2023-12-18 | Paper |
Constructive-destructive heuristics for the safe set problem
Computers & Operations Research | 2023-09-13 | Paper |
Cardinality constrained connected balanced partitions of trees under different criteria
Discrete Optimization | 2023-02-16 | Paper |
Supervisory Control of Timed Discrete-Event Systems With Logical and Temporal Specifications
IEEE Transactions on Automatic Control | 2022-07-28 | Paper |
Maximum feasible subsystems of distance geometry constraints
Journal of Global Optimization | 2022-04-25 | Paper |
Metaheuristics for the minimum gap graph partitioning problem
Computers & Operations Research | 2022-03-07 | Paper |
On finding connected balanced partitions of trees
Discrete Applied Mathematics | 2021-05-31 | Paper |
A branch-and-bound algorithm for the prize-collecting single-machine scheduling problem with deadlines and total tardiness minimization
INFORMS Journal on Computing | 2020-11-09 | Paper |
A bi-objective model for the single-machine scheduling problem with rejection cost and total tardiness minimization
Computers & Operations Research | 2018-12-03 | Paper |
Designing Optimal Deadlock Avoidance Policies for Sequential Resource Allocation Systems Through Classification Theory: Existence Results and Customized Algorithms
IEEE Transactions on Automatic Control | 2017-09-08 | Paper |
| Partitioning a graph into minimum gap components | 2017-02-14 | Paper |
| Multimode extensions of combinatorial optimization problems | 2017-02-14 | Paper |
| The prize-collecting scheduling problem with deadlines | 2017-02-14 | Paper |
The multimode covering location problem
Computers & Operations Research | 2016-11-17 | Paper |
A GRASP metaheuristic for microarray data analysis
Computers & Operations Research | 2016-11-10 | Paper |
Construction and improvement algorithms for dispersion problems
European Journal of Operational Research | 2016-07-08 | Paper |
A variable neighborhood search algorithm for the multimode set covering problem
Journal of Global Optimization | 2015-10-28 | Paper |
Column-generation based bounds for the homogeneous areas problem
European Journal of Operational Research | 2015-07-29 | Paper |
Integrated design of optimal supervisors for the enforcement of static and behavioral specifications in Petri net models
Automatica | 2015-06-25 | Paper |
A branch and bound approach for the design of decentralized supervisors in Petri net models
Automatica | 2015-04-29 | Paper |
Optimal selection of contracts and work shifts in multi-skill call centers
EURO Journal on Computational Optimization | 2015-01-28 | Paper |
Balanced compact clustering for efficient range queries in metric spaces
Discrete Applied Mathematics | 2014-05-06 | Paper |
Employee workload balancing by graph partitioning
Discrete Applied Mathematics | 2014-05-05 | Paper |
Solving the quadratic minimum spanning tree problem
Applied Mathematics and Computation | 2013-12-23 | Paper |
An integer optimization approach for reverse engineering of gene regulatory networks
Discrete Applied Mathematics | 2013-03-12 | Paper |
| Optimal results and tight bounds for the Maximum Diversity Problem | 2011-01-28 | Paper |
Instabilities in creative professions: a minimal model
Nonlinear Dynamics, Psychology, and Life Sciences | 2010-12-15 | Paper |
A RELAX-AND-CUT ALGORITHM FOR THE KNAPSACK NODE WEIGHTED STEINER TREE PROBLEM
Asia-Pacific Journal of Operational Research | 2008-09-25 | Paper |
Tabu search versus GRASP for the maximum diversity problem
4OR | 2008-05-20 | Paper |
Solving the swath segment selection problem through Lagrangean relaxation
Computers & Operations Research | 2007-10-19 | Paper |
A subexponential algorithm for the coloured tree partition problem
Discrete Applied Mathematics | 2007-06-26 | Paper |
The Multicommodity Multilevel Bottleneck Assignment Problem
Electronic Notes in Discrete Mathematics | 2007-05-29 | Paper |
The demand-dependent optimization of regular train timetables
Electronic Notes in Discrete Mathematics | 2007-05-29 | Paper |
An exact algorithm for the node weighted Steiner tree problem
4OR | 2007-04-19 | Paper |
On the complexity of graph tree partition problems.
Discrete Applied Mathematics | 2004-01-26 | Paper |
A heuristic approach to the overnight security service problem
Computers & Operations Research | 2003-04-28 | Paper |
| scientific article; zbMATH DE number 1706198 (Why is no real title available?) | 2002-03-03 | Paper |
A heuristic for the vehicle routing problem with time windows
Journal of Heuristics | 2001-01-01 | Paper |
