| Publication | Date of Publication | Type |
|---|
| Modeling the flying sidekick traveling salesman problem with multiple drones | 2023-12-11 | Paper |
| Exact models for the flying sidekick traveling salesman problem | 2023-11-27 | Paper |
| Parallel drone scheduling vehicle routing problems with collective drones | 2023-07-07 | Paper |
| Constraint Programming models for the parallel drone scheduling vehicle routing problem | 2023-07-06 | Paper |
| Precedence-constrained arborescences | 2023-07-04 | Paper |
| A branch-and-bound algorithm for the precedence-constrained minimum-cost arborescence problem | 2023-07-04 | Paper |
| Matheuristic algorithms for the parallel drone scheduling traveling salesman problem | 2022-07-26 | Paper |
| Learning the Quality of Machine Permutations in Job Shop Scheduling | 2022-07-07 | Paper |
| Drone-assisted deliveries: new formulations for the flying sidekick traveling salesman problem | 2021-07-08 | Paper |
| Scheduling jobs with release dates on identical parallel machines by minimizing the total weighted completion time | 2021-04-20 | Paper |
| A branch-and-price algorithm for the temporal bin packing problem | 2019-11-19 | Paper |
| Models and algorithms for the Flying Sidekick Traveling Salesman Problem | 2019-10-04 | Paper |
| On \(f\)-domination: polyhedral and algorithmic results | 2019-09-19 | Paper |
| On total \(f\)-domination: polyhedral and algorithmic results | 2019-03-22 | Paper |
| Enhanced arc-flow formulations to minimize weighted completion time on identical parallel machines | 2019-01-18 | Paper |
| Mathematical models and decomposition methods for the multiple knapsack problem | 2019-01-09 | Paper |
| Exact algorithms for the bin packing problem with fragile objects | 2018-08-17 | Paper |
| Scheduling cleaning activities on trains by minimizing idle times | 2018-04-04 | Paper |
| A destroy and repair algorithm for the bike sharing rebalancing problem | 2016-11-17 | Paper |
| Friendly bin packing instances without integer round-up property | 2015-04-16 | Paper |
| Combinatorial Benders' Cuts for the Strip Packing Problem | 2014-12-22 | Paper |
| Lower and upper bounds for the bin packing problem with fragile objects | 2014-09-08 | Paper |
| The Bin Packing Problem with Precedence Constraints | 2013-03-12 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4902799 | 2013-01-17 | Paper |
| Heuristic and exact algorithms for the identical parallel machine scheduling problem | 2012-07-28 | Paper |
| Branch-and-cut for the pickup and delivery traveling salesman problem with FIFO loading | 2009-12-22 | Paper |
| Heuristic algorithms for the multi-depot ring-star problem | 2009-12-07 | Paper |
| The Capacitated m-Ring-Star Problem | 2009-08-13 | Paper |
| The single-finger keyboard layout problem | 2009-06-18 | Paper |
| Shortest paths in piecewise continuous time-dependent networks | 2009-01-09 | Paper |
| Assignment Problems | 2008-10-31 | Paper |
| Lower bounds and heuristic algorithms for the \(k_i\)-partitioning problem | 2006-03-22 | Paper |
| Comparing metaheuristic algorithms for SONET network design problems | 2005-11-07 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5692638 | 2005-09-28 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5692626 | 2005-09-28 | Paper |
| New bounds for optimum traffic assignment in satellite communication. | 2003-09-07 | Paper |
| The base-matroid and inverse combinatorial optimization problems. | 2003-06-10 | Paper |
| A linear time algorithm for scheduling outforests with communication delays on three processors | 2003-05-14 | Paper |
| Solution of large weighted equicut problems | 2002-08-18 | Paper |
| A lower bound for the non-oriented two-dimensional bin packing problem | 2002-05-15 | Paper |
| Bounds for the cardinality constrained \(P \|C_{max}\) problem | 2001-08-27 | Paper |
| Reduction of the three-partition problem | 2001-02-09 | Paper |
| Combining linear and nonlinear objectives in spanning tree problems | 2000-10-30 | Paper |
| Exact solution of the SONET ring loading problem | 2000-01-31 | Paper |
| Algorithms and codes for dense assignment problems: The state of the art | 2000-01-30 | Paper |
| Solution of the cumulative assignment problem with a well-structured tabu search method | 1999-11-08 | Paper |
| A Lagrangian heuristic for the Prize Collecting Travelling Salesman Problem | 1998-09-27 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4398377 | 1998-07-19 | Paper |
| The \(k\)-cardinality assignment problem | 1998-03-10 | Paper |
| Algorithm 750: CDT | 1998-01-26 | Paper |
| Exact solution of large-scale, asymmetric traveling salesman problems | 1998-01-26 | Paper |
| Shop Problems With Two Machines and Time Lags | 1998-01-25 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4350061 | 1997-10-27 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4350084 | 1997-08-28 | Paper |
| Optimal Scheduling of Tasks on Identical Parallel Processors | 1997-03-25 | Paper |
| Open shop, satellite communication and a theorem by Egerváry (1931) | 1997-02-11 | Paper |
| On Prize‐collecting Tours and the Asymmetric Travelling Salesman Problem | 1997-01-06 | Paper |
| Complexity of spanning tree problems with leaf-dependent objectives | 1996-08-05 | Paper |
| On some multicriteria arborescence problems: Complexity and algorithms | 1996-07-07 | Paper |
| Minimizing the sum of weighted completion times with unrestricted weights | 1995-12-03 | Paper |
| Heuristic Algorithms for the Multiple Depot Vehicle Scheduling Problem | 1993-09-15 | Paper |
| Applying tabu search to the job-shop scheduling problem | 1993-08-16 | Paper |
| A branch and bound algorithm for the multiple depot vehicle scheduling problem | 1989-01-01 | Paper |
| Self-Labeling the Job Shop Scheduling Problem | N/A | Paper |
