Facets and valid inequalities for the time-dependent travelling salesman problem
- 1 August 2014
- journal article
- Published by Elsevier in European Journal of Operational Research
- Vol. 236 (3) , 891-902
Abstract
No abstract availableKeywords
This publication has 15 references indexed in Scilit:
- The time-dependent traveling salesman problem and single machine scheduling problems with sequence dependent setup timesDiscrete Optimization, 2008
- A new formulation for the Traveling Deliveryman ProblemDiscrete Applied Mathematics, 2008
- A new branch-and-cut algorithm for the capacitated vehicle routing problemMathematical Programming, 2004
- Multistars, partial multistars and the capacitated vehicle routing problemMathematical Programming, 2002
- Lifted Cycle Inequalities for the Asymmetric Traveling Salesman ProblemMathematics of Operations Research, 1999
- On the dimension of projected polyhedraDiscrete Applied Mathematics, 1998
- A classification of formulations for the (time-dependent) traveling salesman problemEuropean Journal of Operational Research, 1995
- Scheduling in a sequence dependent setup environment with genetic searchComputers & Operations Research, 1995
- Time‐dependent traveling salesman problem–the deliveryman caseNetworks, 1990
- Computer Solutions of the Traveling Salesman ProblemBell System Technical Journal, 1965