An integer programming approach for the time-dependent TSP.
Juan José Miranda BrontIsabel Méndez-DíazPaula ZabalaPublished in: Electron. Notes Discret. Math. (2010)
Keyphrases
- integer programming
- np hard
- traveling salesman problem
- travelling salesman
- linear programming
- optimal solution
- constraint programming
- network flow
- ant colony optimization
- ai planning
- column generation
- lagrangian relaxation
- set covering problem
- search space
- cutting plane
- valid inequalities
- combinatorial optimization
- facility location
- production planning
- genetic algorithm
- travel time
- integer program
- transportation problem
- set partitioning
- crew scheduling
- network design problem
- cutting plane algorithm
- integer programming formulations
- bi objective
- approximation algorithms
- branch and bound algorithm
- linear programming relaxation
- constraint satisfaction
- optimization problems
- special case