Publication | Date of Publication | Type |
---|
A combinatorial branch and bound for the safe set problem | 2023-12-18 | Paper |
Constructive-destructive heuristics for the safe set problem | 2023-09-13 | Paper |
Cardinality constrained connected balanced partitions of trees under different criteria | 2023-02-16 | Paper |
Supervisory Control of Timed Discrete-Event Systems With Logical and Temporal Specifications | 2022-07-28 | Paper |
Maximum feasible subsystems of distance geometry constraints | 2022-04-25 | Paper |
Metaheuristics for the minimum gap graph partitioning problem | 2022-03-07 | Paper |
On finding connected balanced partitions of trees | 2021-05-31 | Paper |
A Branch-and-Bound Algorithm for the Prize-Collecting Single-Machine Scheduling Problem with Deadlines and Total Tardiness Minimization | 2020-11-09 | Paper |
A bi-objective model for the single-machine scheduling problem with rejection cost and total tardiness minimization | 2018-12-03 | Paper |
Designing Optimal Deadlock Avoidance Policies for Sequential Resource Allocation Systems Through Classification Theory: Existence Results and Customized Algorithms | 2017-09-08 | Paper |
Multimode extensions of combinatorial optimization problems | 2017-02-14 | Paper |
Partitioning a graph into minimum gap components | 2017-02-14 | Paper |
The prize-collecting scheduling problem with deadlines | 2017-02-14 | Paper |
The multimode covering location problem | 2016-11-17 | Paper |
A GRASP metaheuristic for microarray data analysis | 2016-11-10 | Paper |
Construction and improvement algorithms for dispersion problems | 2016-07-08 | Paper |
A variable neighborhood search algorithm for the multimode set covering problem | 2015-10-28 | Paper |
Column-generation based bounds for the homogeneous areas problem | 2015-07-29 | Paper |
Integrated design of optimal supervisors for the enforcement of static and behavioral specifications in Petri net models | 2015-06-25 | Paper |
A branch and bound approach for the design of decentralized supervisors in Petri net models | 2015-04-29 | Paper |
Optimal selection of contracts and work shifts in multi-skill call centers | 2015-01-28 | Paper |
Balanced compact clustering for efficient range queries in metric spaces | 2014-05-06 | Paper |
Employee workload balancing by graph partitioning | 2014-05-05 | Paper |
Solving the quadratic minimum spanning tree problem | 2013-12-23 | Paper |
An integer optimization approach for reverse engineering of gene regulatory networks | 2013-03-12 | Paper |
https://portal.mardi4nfdi.de/entity/Q3070929 | 2011-01-28 | Paper |
https://portal.mardi4nfdi.de/entity/Q3061335 | 2010-12-15 | Paper |
A RELAX-AND-CUT ALGORITHM FOR THE KNAPSACK NODE WEIGHTED STEINER TREE PROBLEM | 2008-09-25 | Paper |
Tabu search versus GRASP for the maximum diversity problem | 2008-05-20 | Paper |
Solving the swath segment selection problem through Lagrangean relaxation | 2007-10-19 | Paper |
A subexponential algorithm for the coloured tree partition problem | 2007-06-26 | Paper |
The Multicommodity Multilevel Bottleneck Assignment Problem | 2007-05-29 | Paper |
The demand-dependent optimization of regular train timetables | 2007-05-29 | Paper |
An exact algorithm for the node weighted Steiner tree problem | 2007-04-19 | Paper |
On the complexity of graph tree partition problems. | 2004-01-26 | Paper |
A heuristic approach to the overnight security service problem | 2003-04-28 | Paper |
https://portal.mardi4nfdi.de/entity/Q2771641 | 2002-03-03 | Paper |
A heuristic for the vehicle routing problem with time windows | 2001-01-01 | Paper |