| Publication | Date of Publication | Type |
|---|
| Single machine adversarial bilevel scheduling problems | 2024-06-13 | Paper |
| Moderate exponential-time algorithms for scheduling problems | 2022-11-17 | Paper |
| Exact solution of the two-machine flow shop problem with three operations | 2022-03-09 | Paper |
| Parallel machine scheduling with minimum number of tardy jobs: approximation and exponential algorithms | 2021-11-09 | Paper |
| Merging Combinatorial Design and Optimization: the Oberwolfach Problem | 2021-05-28 | Paper |
| Heuristic solution methods for the selective disassembly sequencing problem under sequence-dependent costs | 2021-05-21 | Paper |
| \textit{Branch} \& \textit{Memorize} exact algorithms for sequencing problems: efficient embedding of memorization into search trees | 2021-05-21 | Paper |
| An exact approach for the bilevel knapsack problem with interdiction constraints and extensions | 2020-08-28 | Paper |
| Merging Nodes in Search Trees: an Exact Exponential Algorithm for the Single Machine Total Tardiness Scheduling Problem | 2020-05-27 | Paper |
| The longest processing time rule for identical parallel machines revisited | 2020-04-22 | Paper |
| An enhanced pinwheel algorithm for the bamboo garden trimming problem | 2020-03-27 | Paper |
| Exponential time algorithms for just-in-time scheduling problems with common due date and symmetric weights | 2020-03-24 | Paper |
| Lower bounds and a new exact approach for the Bilevel Knapsack with Interdiction Constraints | 2020-02-06 | Paper |
| No-idle, no-wait: when shop scheduling meets dominoes, Eulerian paths and Hamiltonian paths | 2019-10-08 | Paper |
| A tight linear time \(\frac{13}{12}\)-approximation algorithm for the \(P2 || C_{\max}\) problem | 2019-06-25 | Paper |
| On approximating the incremental knapsack problem | 2019-06-20 | Paper |
| A solution to a Partitioned Balanced Tournament Design of side 11 | 2019-03-14 | Paper |
| Approximating the 3-period incremental knapsack problem | 2019-01-18 | Paper |
| New exact approaches and approximation results for the penalized knapsack problem | 2018-12-18 | Paper |
| An exact exponential branch-and-merge algorithm for the single machine total tardiness problem | 2018-09-24 | Paper |
| An exact approach for the 0-1 knapsack problem with setups | 2018-07-11 | Paper |
| Approximation results for the incremental knapsack problem | 2018-06-15 | Paper |
| A new exact approach for the 0-1 collapsing knapsack problem | 2018-05-29 | Paper |
| A constraint generation approach for two-machine shop problems with jobs selection | 2018-05-25 | Paper |
| An exact semidefinite programming approach for the max-mean dispersion problem | 2017-10-17 | Paper |
| Minimizing the number of tardy jobs in two-machine settings with common due date | 2017-10-17 | Paper |
| A hybrid three-phase approach for the Max-Mean dispersion problem | 2016-11-17 | Paper |
| A note on ``Two-machine flow-shop scheduling with rejection and its link with flow-shop scheduling and common due date assignment | 2016-11-11 | Paper |
| A hybrid heuristic approach for single machine scheduling with release times | 2016-11-10 | Paper |
| The selective fixing algorithm for the closest string problem | 2016-11-10 | Paper |
| A single machine scheduling problem with two-dimensional vector packing constraints | 2016-10-06 | Paper |
| The Red-Blue transportation problem | 2016-06-23 | Paper |
| MP or not MP: that is the question | 2016-05-13 | Paper |
| Erratum—One Machine Sequencing to Minimize Total Tardiness: A Fourth Theorem for Emmons | 2015-11-20 | Paper |
| A Hybrid Heuristic Approach Based on a Quadratic Knapsack Formulation for the Max-Mean Dispersion Problem | 2015-10-16 | Paper |
| A Constraint Generation Approach for the Two-Machine Flow Shop Problem with Jobs Selection | 2015-10-16 | Paper |
| On the max min vertex cover problem | 2015-09-30 | Paper |
| Lower bounds on the approximation ratios of leading heuristics for the single-machine total tardiness problem | 2015-01-22 | Paper |
| Efficient algorithms for the \textsc{max~\(k\)-vertex cover problem} | 2015-01-21 | Paper |
| A variable neighborhood search based matheuristic for nurse rostering problems | 2014-11-26 | Paper |
| A matheuristic approach for the two-machine total completion time flow shop problem | 2014-09-26 | Paper |
| On the max min vertex cover Problem | 2014-09-02 | Paper |
| Reoptimization in machine scheduling | 2014-06-06 | Paper |
| Approximating the metric 2-peripatetic salesman problem | 2013-12-11 | Paper |
| Fast algorithms for min independent dominating set | 2013-03-12 | Paper |
| Improved core problem based heuristics for the 0/1 multi-dimensional knapsack problem | 2012-11-15 | Paper |
| Improved LP-based algorithms for the closest string problem | 2012-11-15 | Paper |
| Iterated local search and very large neighborhoods for the parallel-machines total tardiness problem | 2012-11-15 | Paper |
| Algorithms for dominating clique problems | 2012-11-08 | Paper |
| A note on minimizing the sum of quadratic completion times on two identical parallel machines | 2012-10-23 | Paper |
| Efficient Algorithms for the max k -vertex cover Problem | 2012-09-21 | Paper |
| Improving an exact approach for solving separable integer quadratic knapsack problems | 2012-07-10 | Paper |
| Enumeration of Pareto optima for a flowshop scheduling problem with two criteria | 2012-06-18 | Paper |
| Discrete-time, economic lot scheduling problem on multiple, non-identical production lines | 2012-05-14 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3081837 | 2011-03-09 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3081836 | 2011-03-09 | Paper |
| Improving the preemptive bound for the single machine dynamic maximum lateness problem | 2010-12-23 | 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 |
| Exact Algorithms for Dominating Clique Problems | 2009-12-17 | Paper |
| Probabilistic graph-coloring in bipartite and split graphs | 2009-10-09 | Paper |
| Approximation algorithms for the 2-peripatetic salesman problem with edge weights 1 and 2 | 2009-06-24 | Paper |
| A heuristic approach for the max-min diversity problem based on max-clique | 2009-04-03 | Paper |
| Exploiting dominance conditions for computing non trivial worst-case complexity for bounded combinatorial optimization problems | 2009-02-17 | Paper |
| Complexity of single machine scheduling problems under scenario-based uncertainty | 2008-09-10 | Paper |
| A ``maximum node clustering problem | 2008-04-04 | Paper |
| An exact algorithm for MAX-CUT in sparse graphs | 2008-01-21 | Paper |
| Revisiting branch and bound search strategies for machine scheduling problems | 2007-12-20 | Paper |
| Lower bounds on the approximation ratios of leading heuristics for the single-machine total tardiness problem | 2007-12-20 | Paper |
| Improved worst-case complexity for the MIN 3-SET COVERING problem | 2007-08-27 | Paper |
| Approximation algorithms for 2-Peripathetic Salesman Problem with edge weights 1 and 2 | 2007-05-29 | Paper |
| Algorithms and Computation | 2006-11-14 | Paper |
| Scheduling the Italian football league: an ILP-based approach | 2006-01-18 | Paper |
| A Recovering Beam Search algorithm for the one-machine dynamic total completion time scheduling problem | 2005-03-14 | Paper |
| Minimising makespan in the two-machine flow-shop with release times | 2005-01-19 | Paper |
| A new decomposition approach for the single machine total tardiness scheduling problem | 2005-01-19 | Paper |
| Solving the Hub location problem in telecommunication network design: A local search approach | 2005-01-12 | Paper |
| Recovering beam search: Enhancing the beam search approach for combinatorial optimization problems | 2004-08-06 | Paper |
| An enhanced dynasearch neighborhood for the single-machine total weighted tardiness scheduling problem | 2004-07-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4452990 | 2004-03-07 | Paper |
| A greedy-based neighborhood search approach to a nurse rostering problem. | 2004-01-05 | Paper |
| Improving the preemptive bound for the one-machine dynamic total completion time scheduling problem. | 2003-11-17 | Paper |
| A Heuristic Algorithm for the Auto-Carrier Transportation Problem | 2003-07-07 | Paper |
| Finding the Pareto-optima for the total and maximum tardiness single machine problem | 2002-12-02 | Paper |
| An improved branch-and-bound algorithm for the two machine total completion time flow shop problem | 2002-07-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 |
| An improved general procedure for lexicographic bottleneck problems | 2001-02-09 | Paper |
| Minimizing tardy jobs in a flowshop with common due date | 2000-03-19 | Paper |
| Scheduling a round robin tennis tournament under courts and players availability constraints | 2000-01-11 | Paper |
| Aggregate planning and scheduling in the food industry: A case study | 1998-12-08 | Paper |
| Generalized pairwise interchanges and machine scheduling | 1998-06-11 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4859582 | 1996-07-29 | Paper |
| Advanced search techniques for the job shop problem : a comparison | 1995-08-27 | Paper |
| A genetic algorithm for the job shop problem | 1995-02-13 | Paper |
| A multi-KP modeling for the maximum-clique problem | 1994-07-26 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4289898 | 1994-04-28 | Paper |
| Cellular control of manufacturing systems | 1994-01-06 | Paper |
