An integer programming approach for the time-dependent TSP
Authors:
- Juan José Miranda-BrontJMJuan José Miranda-Bront
- Isabel Méndez-DíazIMIsabel Méndez-Díaz
- Paula ZabalaPZPaula Zabala
- 1 August 2010
- journal article
- research article
- Published by Elsevier in Electronic Notes in Discrete Mathematics
- Vol. 36, 351-358
Abstract
No abstract availableThis publication has 9 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
- Lifted Cycle Inequalities for the Asymmetric Traveling Salesman ProblemMathematics of Operations Research, 1999
- On the dimension of projected polyhedraDiscrete Applied Mathematics, 1998
- An exact solution approach for the time‐dependent traveling‐salesman problemNaval Research Logistics (NRL), 1996
- 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
- Technical Note—An n-Constraint Formulation of the (Time-Dependent) Traveling Salesman ProblemOperations Research, 1980
- The Time-Dependent Traveling Salesman Problem and Its Application to the Tardiness Problem in One-Machine SchedulingOperations Research, 1978