| Publication | Date of Publication | Type |
|---|
| Mathematical formulations for consistent travelling salesman problems | 2024-06-14 | Paper |
| Tool switching problems with tool order constraints | 2024-02-27 | Paper |
| Tool switching problems in the context of overlay printing with multiple colours | 2023-08-03 | Paper |
| An efficient multistart heuristic for the driver and vehicle routing problem | 2022-12-19 | Paper |
| Selective routing problem with synchronization | 2022-03-09 | Paper |
| A branch-and-cut algorithm for the split-demand one-commodity pickup-and-delivery travelling salesman problem | 2021-11-09 | Paper |
| The pickup and delivery problem with split loads and transshipments: a branch-and-cut solution approach | 2021-06-03 | Paper |
| Designing optimal masks for a multi-object spectrometer | 2021-01-09 | Paper |
| Balanced vehicle routing: polyhedral analysis and branch-and-cut algorithm | 2018-11-19 | Paper |
| The periodic vehicle routing problem with driver consistency | 2018-11-19 | Paper |
| The capacitated vehicle routing problem: stronger bounds in pseudo-polynomial time | 2018-10-30 | Paper |
| An exact algorithm for the Split-Demand One-Commodity Pickup-And-Delivery Travelling Salesman problem | 2018-08-17 | Paper |
| The driver and vehicle routing problem | 2018-07-12 | Paper |
| An exact algorithm for a vehicle-and-driver scheduling problem | 2018-07-11 | Paper |
| Heuristic algorithm for the split-demand one-commodity pickup-and-delivery travelling salesman problem | 2018-07-11 | Paper |
| Solving the team orienteering arc routing problem with a column generation approach | 2018-05-30 | Paper |
| An algorithmic framework for the exact solution of tree-star problems | 2018-05-29 | Paper |
| The ring/κ‐rings network design problem: Model and branch‐and‐cut algorithm | 2018-05-23 | Paper |
| The connected facility location polytope | 2017-12-20 | Paper |
| A hybrid heuristic approach for the multi-commodity one-to-one pickup-and-delivery traveling salesman problem | 2017-06-27 | Paper |
| Topological protection from exceptional points in Weyl and nodal line semimetals | 2017-02-08 | Paper |
| A branch-and-cut algorithm for two-level survivable network design problems | 2016-11-17 | Paper |
| A column generation approach for a school bus routing problem with resource constraints | 2016-11-14 | Paper |
| The traveling purchaser problem, with multiple stacks and deliveries: a branch-and-cut approach | 2016-11-10 | Paper |
| Enhanced controlled tabular adjustment | 2016-11-10 | Paper |
| Single liner shipping service design | 2016-11-10 | Paper |
| A branch-and-cut algorithm for the hub location and routing problem | 2016-11-10 | Paper |
| Hierarchical survivable network design problems | 2016-10-18 | Paper |
| A hybrid heuristic approach for the multi-commodity pickup-and-delivery traveling salesman problem | 2016-10-07 | Paper |
| Stronger multi-commodity flow formulations of the (capacitated) sequential ordering problem | 2016-10-07 | Paper |
| Stronger multi-commodity flow formulations of the capacitated vehicle routing problem | 2016-10-06 | Paper |
| The Balanced Minimum Evolution Problem | 2016-06-29 | Paper |
| The multi-commodity pickup-and-delivery traveling salesman problem | 2016-06-10 | Paper |
| On the Asymmetric Connected Facility Location Polytope | 2015-10-16 | Paper |
| A MIP-based approach to solve the prize-collecting local access network design problem | 2015-02-19 | Paper |
| Polynomial-time separation of enhanced reverse multistar inequalities | 2014-05-14 | Paper |
| https://portal.mardi4nfdi.de/entity/Q2861498 | 2013-11-08 | Paper |
| https://portal.mardi4nfdi.de/entity/Q2861522 | 2013-11-08 | Paper |
| Reverse multistar inequalities and vehicle routing problems with a lower bound on the number of customers per route | 2013-08-06 | Paper |
| Solving school bus routing using the multiple vehicle traveling purchaser problem: a branch-and-cut approach | 2012-11-15 | Paper |
| Decorous Lower Bounds for Minimum Linear Arrangement | 2012-07-28 | Paper |
| Exact approaches to the single-source network loading problem | 2012-06-18 | Paper |
| Laying Out Sparse Graphs with Provably Minimum Bandwidth | 2012-06-08 | Paper |
| Generalized network design polyhedra | 2011-11-21 | Paper |
| A Heuristic Algorithm for a Prize-Collecting Local Access Network Design Problem | 2011-09-09 | Paper |
| The Multi-Commodity One-to-One Pickup-and-Delivery Traveling Salesman Problem: A Matheuristic | 2011-09-09 | Paper |
| Comments on: Routing Problems with loading constraints | 2010-12-13 | Paper |
| Statistical confidentiality. Principles and practice. | 2010-12-03 | Paper |
| A branch-and-cut algorithm for the pickup and delivery traveling salesman problem with LIFO loading | 2010-11-24 | Paper |
| The multi-commodity one-to-one pickup-and-delivery traveling salesman problem | 2009-12-07 | Paper |
| Hybridization of very large neighborhood search for ready-mixed concrete delivery problems | 2009-11-17 | Paper |
| A local branching heuristic for the capacitated fixed-charge network design problem | 2009-11-17 | Paper |
| Mathematical models to reconstruct phylogenetic trees under the minimum evolution criterion | 2009-07-28 | Paper |
| A Unified Mathematical Programming Framework for Different Statistical Disclosure Limitation Methods | 2009-07-18 | Paper |
| A Branch-and-Cut Algorithm for the Undirected Traveling Purchaser Problem | 2009-07-09 | Paper |
| On the one-commodity pickup-and-delivery traveling salesman problem with stochastic demands | 2009-04-24 | Paper |
| A new approach for data editing and imputation | 2009-01-30 | Paper |
| A hybrid GRASP/VND heuristic for the one-commodity pickup-and-delivery traveling salesman problem | 2008-12-17 | Paper |
| A New Lower Bound for the Minimum Linear Arrangement of a Graph | 2008-06-05 | Paper |
| An algorithm for checking whether the toric ideal of an affine monomial curve is a complete intersection | 2008-02-04 | Paper |
| The one‐commodity pickup‐and‐delivery traveling salesman problem: Inequalities and algorithms | 2008-01-07 | Paper |
| Solving a capacitated hub location problem | 2007-10-10 | Paper |
| A branch-and-cut algorithm for the continuous error localization problem in data cleaning | 2007-04-13 | Paper |
| A heuristic approach for the continuous error localization problem in data cleaning | 2007-02-26 | Paper |
| Solving the asymmetric traveling purchaser problem | 2007-02-15 | Paper |
| Projection results for vehicle routing | 2006-01-13 | Paper |
| Controlled rounding and cell perturbation: statistical disclosure limitation methods for tabular data | 2006-01-13 | Paper |
| A branch-and-cut algorithm for the plant-cycle location problem | 2005-04-04 | Paper |
| A heuristic approach for the travelling purchaser problem | 2005-02-09 | Paper |
| A branch-and-cut algorithm for a traveling salesman problem with pickup and delivery | 2005-01-31 | Paper |
| Locating median cycles in networks | 2004-11-22 | Paper |
| The biobjective travelling purchaser problem | 2004-11-12 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4738646 | 2004-08-11 | Paper |
| The Ring Star Problem: Polyhedral analysis and exact algorithm | 2004-08-04 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4461915 | 2004-05-18 | Paper |
| Mathematical models for applying cell suppression methodology in statistical data protection. | 2004-02-02 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4414640 | 2003-07-25 | Paper |
| The Steiner cycle polytope | 2003-05-19 | Paper |
| Optimisation of the interconnecting network of a UMTS radio mobile telephone system | 2003-04-28 | Paper |
| Separating lifted odd-hole inequalities to solve the index selection problem | 2001-09-03 | Paper |
| A Branch-and-Cut Algorithm for the Symmetric Generalized Traveling Salesman Problem | 1998-09-01 | Paper |
| Solving the Orienteering Problem through Branch-and-Cut | 1998-01-01 | Paper |
| The symmetric generalized traveling salesman polytope | 1996-11-13 | Paper |
| A branch-and-cut algorithm for a generalization of the uncapacitated facility location problem | 1996-10-31 | Paper |
| Group decision processes: MOLP procedures facilitating group and individual decision orientations | 1993-02-18 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4011527 | 1992-09-27 | Paper |
| A comparison of two interactive MCDM procedures | 1989-01-01 | Paper |
| A multiple criteria approach to aggregate industrial capacity expansion | 1988-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3347651 | 1985-01-01 | Paper |
