On the convergence of a new time window discretization method for the traveling salesman problem with time window constraints
- 28 February 2009
- journal article
- Published by Elsevier BV in Computers & Industrial Engineering
- Vol. 56 (1), 161-164
- https://doi.org/10.1016/j.cie.2008.04.011
Abstract
No abstract availableKeywords
This publication has 10 references indexed in Scilit:
- A Branch-and-Cut Procedure for the Vehicle Routing Problem with Time WindowsTransportation Science, 2002
- Local truckload pickup and delivery with hard time window constraintsTransportation Research Part B: Methodological, 2002
- An Efficient Airline Re-Fleeting Model for the Incremental Modification of Planned Fleet AssignmentsTransportation Science, 2000
- A Lower Bound for the Split Delivery Vehicle Routing ProblemOperations Research, 2000
- The fleet assignment problem: Solving a large-scale integer programMathematical Programming, 1995
- Classification of travelling salesman problem formulationsOperations Research Letters, 1990
- Scheduling School BusesManagement Science, 1984
- Scheduling and Fleet Routing Models for Transportation SystemsTransportation Science, 1971
- Integer Programming Methods for a Vessel Scheduling ProblemTransportation Science, 1971
- A Column Generation Algorithm for a Ship Scheduling ProblemTransportation Science, 1969