| Publication | Date of Publication | Type |
|---|
A Multi-Exchange Heuristic for the Single-Source Capacitated Facility Location Problem
Management Science | 2012-02-19 | Paper |
The stack loading and unloading problem
Discrete Applied Mathematics | 2009-03-04 | Paper |
On uniform \(k\)-partition problems
Discrete Applied Mathematics | 2005-09-28 | Paper |
scientific article; zbMATH DE number 2096648 (Why is no real title available?)
| 2004-09-06 | Paper |
Large-scale local search heuristics for the capacitated vertexp-center problem
Networks | 2004-08-04 | Paper |
A new algorithm for reoptimizing shortest paths when the arc costs change
Operations Research Letters | 2003-11-17 | Paper |
Dynamic shortest paths minimizing travel times and costs
Networks | 2003-07-31 | Paper |
Minimum Time and Minimum Cost-Path Problems in Street Networks with Periodic Traffic Lights
Transportation Science | 2003-06-29 | Paper |
Implicit enumeration of hyperpaths in a logit model for transit networks
Transportation Science | 2002-04-17 | Paper |
scientific article; zbMATH DE number 1488066 (Why is no real title available?)
| 2001-11-21 | Paper |
A Modeling Framework for Passenger Assignment on a Transport Network with Timetables
Transportation Science | 2001-01-01 | Paper |
Postoptimizing equilibrium flows on large scale networks
European Journal of Operational Research | 1999-02-22 | Paper |
Dual algorithms for the shortest path tree problem
| 1997-11-25 | Paper |
scientific article; zbMATH DE number 915569 (Why is no real title available?)
| 1996-08-11 | Paper |
Polynomial auction algorithms for shortest paths
Computational Optimization and Applications | 1995-06-11 | Paper |
Directed hypergraphs and applications
Discrete Applied Mathematics | 1993-06-29 | Paper |
Fair dissections of spiders, worms, and caterpillars
Networks | 1992-06-25 | Paper |
The maximum flow problem: A max-preflow approach
European Journal of Operational Research | 1991-01-01 | Paper |
Technical Note—Traffic Equilibrium Paradoxes
Transportation Science | 1991-01-01 | Paper |
scientific article; zbMATH DE number 4112412 (Why is no real title available?)
| 1989-01-01 | Paper |
Equilibrium traffic assignment for large scale transit networks
European Journal of Operational Research | 1988-01-01 | Paper |
Shortest path methods: A unifying approach
Mathematical Programming Studies | 1986-01-01 | Paper |
Shortest‐path methods: Complexity, interrelations and new propositions
Networks | 1984-01-01 | Paper |
scientific article; zbMATH DE number 3952519 (Why is no real title available?)
| 1984-01-01 | Paper |
A new algorithm to find the shortest paths between all pairs of nodes
Discrete Applied Mathematics | 1982-01-01 | Paper |
A dual simplex algorithm for finding all shortest paths
Networks | 1981-01-01 | Paper |
scientific article; zbMATH DE number 3954287 (Why is no real title available?)
| 1981-01-01 | Paper |
An Efficient Algorithm for Determining the Length of the Longest Dead Path in a “LIFO” Branch-and-Bound Exploration Schema
ACM Transactions on Mathematical Software | 1981-01-01 | Paper |
scientific article; zbMATH DE number 3947999 (Why is no real title available?)
| 1979-01-01 | Paper |
scientific article; zbMATH DE number 3655647 (Why is no real title available?)
| 1978-01-01 | Paper |
scientific article; zbMATH DE number 3674131 (Why is no real title available?)
| 1978-01-01 | Paper |
