| Publication | Date of Publication | Type |
|---|
| The daily swab test collection problem | 2024-05-30 | Paper |
| Job Shop Scheduling via Deep Reinforcement Learning: a Sequence to Sequence approach | 2023-08-03 | Paper |
| The connected critical node problem | 2022-06-13 | Paper |
| Column generation and rounding heuristics for minimizing the total weighted completion time on a single batching machine | 2022-03-09 | Paper |
| Polynomial and pseudo-polynomial time algorithms for different classes of the distance critical node problem | 2018-12-18 | Paper |
| A preliminary analysis of the distance based critical node problem | 2017-02-14 | Paper |
| Searching for a cycle with maximum coverage in undirected graphs | 2016-10-27 | Paper |
| A genetic algorithm for a class of critical node problems | 2016-10-18 | Paper |
| A single machine scheduling problem with two-dimensional vector packing constraints | 2016-10-06 | Paper |
| VNS solutions for the critical node problem | 2016-07-29 | Paper |
| Construction and improvement algorithms for dispersion problems | 2016-07-08 | Paper |
| Hybrid constructive heuristics for the critical node problem | 2016-04-20 | Paper |
| Lower bounds on the approximation ratios of leading heuristics for the single-machine total tardiness problem | 2015-01-22 | Paper |
| A matheuristic approach for the two-machine total completion time flow shop problem | 2014-09-26 | Paper |
| Identifying critical nodes in undirected graphs: complexity results and polynomial algorithms for the case of bounded treewidth | 2014-04-10 | Paper |
| Branch and cut algorithms for detecting critical nodes in undirected graphs | 2013-02-18 | Paper |
| Improved core problem based heuristics for the 0/1 multi-dimensional knapsack problem | 2012-11-15 | Paper |
| Iterated local search and very large neighborhoods for the parallel-machines total tardiness problem | 2012-11-15 | Paper |
| Complexity of the critical node problem over trees | 2011-06-30 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3081837 | 2011-03-09 | Paper |
| Computational experience with a core-based reduction procedure for the 2-knapsack problem | 2010-10-15 | Paper |
| Sequencing a single machine with due dates and deadlines: An ILP-based approach to solve very large instances | 2010-05-07 | Paper |
| Solving the problem of packing equal and unequal circles in a circular container | 2010-05-07 | Paper |
| Solving molecular distance geometry problems by global optimization algorithms | 2009-09-25 | Paper |
| Finding maximin Latin hypercube designs by iterated local search heuristics | 2009-04-30 | Paper |
| A heuristic approach for the max-min diversity problem based on max-clique | 2009-04-03 | Paper |
| Simple ingredients leading to very efficient heuristics for the maximum clique problem | 2009-03-31 | Paper |
| A ``maximum node clustering problem | 2008-04-04 | Paper |
| An experimental analysis of a population based approach for global optimization | 2008-03-12 | Paper |
| Lower bounds on the approximation ratios of leading heuristics for the single-machine total tardiness problem | 2007-12-20 | Paper |
| A population-based approach for hard global optimization problems based on dissimilarity measures | 2007-05-10 | Paper |
| A new decomposition approach for the single machine total tardiness scheduling problem | 2005-01-19 | Paper |
| An enhanced dynasearch neighborhood for the single-machine total weighted tardiness scheduling problem | 2004-07-01 | Paper |
| Finding the Pareto-optima for the total and maximum tardiness single machine problem | 2002-12-02 | Paper |
| Optimal facility location with random throughput costs | 2002-04-03 | Paper |
| Algorithmic paradoxes of the single-machine total tardiness problem | 2001-07-12 | Paper |
| Solution of the single machine total tardiness problem | 2001-07-08 | Paper |
| Efficient arc-flow formulations for makespan minimisation on parallel machines with a common server | N/A | Paper |
