| Publication | Date of Publication | Type |
|---|
Worst-case analysis of a new heuristic for the travelling salesman problem
SN Operations Research Forum | 2022-03-31 | Paper |
Robust risk budgeting
Annals of Operations Research | 2018-11-12 | Paper |
Worst-case robust Omega ratio
European Journal of Operational Research | 2015-02-03 | Paper |
Exact methods for large-scale multi-period financial planning problems
Computational Management Science | 2009-09-03 | Paper |
scientific article; zbMATH DE number 5589695 (Why is no real title available?)
| 2009-08-03 | Paper |
Capital Budgeting Under Uncertainty—An Integrated Approach Using Contingent Claims Analysis and Integer Programming
Operations Research | 2009-07-03 | Paper |
Risk Exchange with Distorted Probabilities
ASTIN Bulletin | 2009-06-15 | Paper |
An exact algorithm for the vehicle routing problem based on the set partitioning formulation with additional cuts
Mathematical Programming. Series A. Series B | 2008-10-16 | Paper |
Implied non-recombining trees and calibration for the volatility smile
Quantitative Finance | 2007-10-22 | Paper |
A dynamic programming approach for solving single-source uncapacitated concave minimum cost network flow problems
European Journal of Operational Research | 2006-09-13 | Paper |
A branch-and-bound algorithm for concave network flow problems
Journal of Global Optimization | 2006-06-28 | Paper |
Lower bounds from state space relaxations for concave cost network flow problems
Journal of Global Optimization | 2006-06-28 | Paper |
The design of corporate tax structures
Mathematical Programming. Series A. Series B | 2004-03-11 | Paper |
Upper bounds for single-source uncapacitated concave minimum-cost network flow problems
Networks | 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
Computational Statistics and Data Analysis | 2000-06-04 | Paper |
Vehicle routing with a sparse feasibility graph
European Journal of Operational Research | 1999-02-22 | Paper |
An exact algorithm for general, orthogonal, two-dimensional knapsack problems
European Journal of Operational Research | 1998-06-11 | Paper |
An exact algorithm for orthogonal 2-D cutting problems using guillotine cuts
European Journal of Operational Research | 1998-06-11 | Paper |
Data structures for topological and geometric operations on networks
Annals of Operations Research | 1997-11-26 | Paper |
Capacitated clustering problems by hybrid simulated annealing and tabu search
International Transactions in Operational Research | 1996-10-30 | Paper |
A new exact algorithm for the vehicle routing problem based on \(q\)-paths and \(k\)-shortest paths relaxations
Annals of Operations Research | 1996-03-18 | Paper |
An algorithm for the resource constrained shortest path problem
Networks | 1989-01-01 | Paper |
An Exact Algorithm for the Quadratic Assignment Problem on a Tree
Operations Research | 1989-01-01 | Paper |
Project scheduling with resource constraints: A branch and bound approach. Note by Frederik Kaefer
European Journal of Operational Research | 1987-01-01 | Paper |
Semi-independence number of a graph and the existence of Hamiltonian circuits
Discrete Applied Mathematics | 1987-01-01 | Paper |
An algorithm for the Rural Postman problem on a directed graph
Mathematical Programming Studies | 1986-01-01 | Paper |
Conditions for the Existence of Hamiltonian Circuits in Graphs Based on Vertex Degrees
Journal of the London Mathematical Society | 1985-01-01 | Paper |
scientific article; zbMATH DE number 3912104 (Why is no real title available?)
| 1985-01-01 | Paper |
scientific article; zbMATH DE number 3912105 (Why is no real title available?)
| 1985-01-01 | Paper |
The period routing problem
Networks | 1984-01-01 | Paper |
scientific article; zbMATH DE number 3871059 (Why is no real title available?)
| 1984-01-01 | Paper |
Extensions to a Lagrangean relaxation approach for the capacitated warehouse location problem
European Journal of Operational Research | 1983-01-01 | Paper |
A tree search algorithm for the p-median problem
European Journal of Operational Research | 1982-01-01 | Paper |
scientific article; zbMATH DE number 3799403 (Why is no real title available?)
| 1982-01-01 | Paper |
Exact algorithms for the vehicle routing problem, based on spanning tree and shortest path relaxations
Mathematical Programming | 1981-01-01 | Paper |
State-space relaxation procedures for the computation of bounds to routing problems
Networks | 1981-01-01 | Paper |
A restricted Lagrangean approach to the traveling salesman problem
Mathematical Programming | 1981-01-01 | Paper |
scientific article; zbMATH DE number 3742993 (Why is no real title available?)
| 1981-01-01 | Paper |
A Graph Theoretic Analysis of Bounds for the Quadratic Assignment Problem
North-Holland Mathematics Studies | 1981-01-01 | Paper |
Strong sufficient conditions for the existence of Hamiltonian circuits in undirected graphs
Journal of Combinatorial Theory. Series B | 1981-01-01 | Paper |
Contributions to the quadratic assignment problem
European Journal of Operational Research | 1980-01-01 | Paper |
Dynamic Loading and Unloading of Liquids into Tanks
Operations Research | 1980-01-01 | Paper |
scientific article; zbMATH DE number 3643061 (Why is no real title available?)
| 1979-01-01 | Paper |
scientific article; zbMATH DE number 3643036 (Why is no real title available?)
| 1979-01-01 | Paper |
scientific article; zbMATH DE number 3646634 (Why is no real title available?)
| 1979-01-01 | Paper |
scientific article; zbMATH DE number 3652033 (Why is no real title available?)
| 1979-01-01 | Paper |
An Algorithm for Two-Dimensional Cutting Problems
Operations Research | 1977-01-01 | Paper |
scientific article; zbMATH DE number 3526435 (Why is no real title available?)
| 1976-01-01 | Paper |
A Sequential Approach to the $0 - 1$ Linear Programming Problem
SIAM Journal on Applied Mathematics | 1976-01-01 | Paper |
scientific article; zbMATH DE number 3503127 (Why is no real title available?)
| 1975-01-01 | Paper |
Note—A Computational Survey of Methods for the Set Covering Problem
Management Science | 1975-01-01 | Paper |
scientific article; zbMATH DE number 3485513 (Why is no real title available?)
| 1975-01-01 | Paper |
Errata
Operations Research | 1974-01-01 | Paper |
Algorithms for Large-scale Travelling Salesman Problems
The Journal of the Operational Research Society | 1972-01-01 | Paper |
Technical Note—Bounds for the Travelling-Salesman Problem
Operations Research | 1972-01-01 | Paper |
The Loading Problem
Management Science | 1971-01-01 | Paper |
The Optimum Location of Multi-centres on a Graph
The Journal of the Operational Research Society | 1971-01-01 | Paper |
An algorithm for the chromatic number of a graph
The Computer Journal | 1971-01-01 | Paper |
Zero-one programming using non-binary tree-search
The Computer Journal | 1971-01-01 | Paper |
