The pickup and delivery problem: Faces and branch-and-cut algorithm
Authors:
- K.S. RulandKRK.S. Ruland
- E.Y. RodinERE.Y. Rodin
- 1 June 1997
- journal article
- Published by Elsevier in Computers & Mathematics with Applications
- Vol. 33 (12) , 1-13
Abstract
No abstract availableKeywords
This publication has 15 references indexed in Scilit:
- Survey of facial results for the traveling salesman polytopeMathematical and Computer Modelling, 1998
- The Crown Inequalities for the Symmetric Traveling Salesman PolytopeMathematics of Operations Research, 1992
- The pickup and delivery problem with time windowsEuropean Journal of Operational Research, 1991
- A Branch-and-Cut Algorithm for the Resolution of Large-Scale Symmetric Traveling Salesman ProblemsSIAM Review, 1991
- Clique Tree Inequalities and the Symmetric Travelling Salesman ProblemMathematics of Operations Research, 1986
- A heuristic algorithm for the multi-vehicle advance request dial-a-ride problem with time windowsTransportation Research Part B: Methodological, 1986
- Optimizing Single Vehicle Many-to-Many Operations with Desired Delivery Times: II. RoutingTransportation Science, 1985
- Optimizing Single Vehicle Many-to-Many Operations with Desired Delivery Times: I. SchedulingTransportation Science, 1985
- k-Interchange procedures for local search in a precedence-constrained routing problemEuropean Journal of Operational Research, 1983
- An Exact Algorithm for the Single Vehicle Many-to-Many Dial-A-Ride Problem with Time WindowsTransportation Science, 1983