| Publication | Date of Publication | Type |
|---|
| Worst-case analysis of a new heuristic for the travelling salesman problem | 2022-03-31 | Paper |
| Robust risk budgeting | 2018-11-12 | Paper |
| Worst-case robust Omega ratio | 2015-02-03 | Paper |
| Exact methods for large-scale multi-period financial planning problems | 2009-09-03 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5324640 | 2009-08-03 | Paper |
| Capital Budgeting Under Uncertainty—An Integrated Approach Using Contingent Claims Analysis and Integer Programming | 2009-07-03 | Paper |
| Risk Exchange with Distorted Probabilities | 2009-06-15 | Paper |
| An exact algorithm for the vehicle routing problem based on the set partitioning formulation with additional cuts | 2008-10-16 | Paper |
| Implied non-recombining trees and calibration for the volatility smile | 2007-10-22 | Paper |
| A dynamic programming approach for solving single-source uncapacitated concave minimum cost network flow problems | 2006-09-13 | Paper |
| A branch-and-bound algorithm for concave network flow problems | 2006-06-28 | Paper |
| Lower bounds from state space relaxations for concave cost network flow problems | 2006-06-28 | Paper |
| The design of corporate tax structures | 2004-03-11 | Paper |
| Upper bounds for single-source uncapacitated concave minimum-cost network flow problems | 2003-07-31 | Paper |
| An efficient implementation of an algorithm for findingK shortest simple paths | 2001-05-02 | Paper |
| The optimal discretization of probability density functions | 2000-06-04 | Paper |
| Vehicle routing with a sparse feasibility graph | 1999-02-22 | Paper |
| An exact algorithm for general, orthogonal, two-dimensional knapsack problems | 1998-06-11 | Paper |
| An exact algorithm for orthogonal 2-D cutting problems using guillotine cuts | 1998-06-11 | Paper |
| Data structures for topological and geometric operations on networks | 1997-11-26 | Paper |
| Capacitated clustering problems by hybrid simulated annealing and tabu search | 1996-10-30 | Paper |
| A new exact algorithm for the vehicle routing problem based on \(q\)-paths and \(k\)-shortest paths relaxations | 1996-03-18 | Paper |
| An algorithm for the resource constrained shortest path problem | 1989-01-01 | Paper |
| An Exact Algorithm for the Quadratic Assignment Problem on a Tree | 1989-01-01 | Paper |
| Project scheduling with resource constraints: A branch and bound approach. Note by Frederik Kaefer | 1987-01-01 | Paper |
| Semi-independence number of a graph and the existence of Hamiltonian circuits | 1987-01-01 | Paper |
| An algorithm for the Rural Postman problem on a directed graph | 1986-01-01 | Paper |
| Conditions for the Existence of Hamiltonian Circuits in Graphs Based on Vertex Degrees | 1985-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3688098 | 1985-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3688099 | 1985-01-01 | Paper |
| The period routing problem | 1984-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3337973 | 1984-01-01 | Paper |
| Extensions to a Lagrangean relaxation approach for the capacitated warehouse location problem | 1983-01-01 | Paper |
| A tree search algorithm for the p-median problem | 1982-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4744064 | 1982-01-01 | Paper |
| Exact algorithms for the vehicle routing problem, based on spanning tree and shortest path relaxations | 1981-01-01 | Paper |
| State-space relaxation procedures for the computation of bounds to routing problems | 1981-01-01 | Paper |
| A restricted Lagrangean approach to the traveling salesman problem | 1981-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3929516 | 1981-01-01 | Paper |
| A Graph Theoretic Analysis of Bounds for the Quadratic Assignment Problem | 1981-01-01 | Paper |
| Strong sufficient conditions for the existence of Hamiltonian circuits in undirected graphs | 1981-01-01 | Paper |
| Contributions to the quadratic assignment problem | 1980-01-01 | Paper |
| Dynamic Loading and Unloading of Liquids into Tanks | 1980-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3048611 | 1979-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3048582 | 1979-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3205014 | 1979-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3851932 | 1979-01-01 | Paper |
| An Algorithm for Two-Dimensional Cutting Problems | 1977-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4103312 | 1976-01-01 | Paper |
| A Sequential Approach to the $0 - 1$ Linear Programming Problem | 1976-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4083324 | 1975-01-01 | Paper |
| Note—A Computational Survey of Methods for the Set Covering Problem | 1975-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4068471 | 1975-01-01 | Paper |
| Errata | 1974-01-01 | Paper |
| Algorithms for Large-scale Travelling Salesman Problems | 1972-01-01 | Paper |
| Technical Note—Bounds for the Travelling-Salesman Problem | 1972-01-01 | Paper |
| The Loading Problem | 1971-01-01 | Paper |
| The Optimum Location of Multi-centres on a Graph | 1971-01-01 | Paper |
| An algorithm for the chromatic number of a graph | 1971-01-01 | Paper |
| Zero-one programming using non-binary tree-search | 1971-01-01 | Paper |
