New tighter polynomial length formulations for the asymmetric traveling salesman problem with and without precedence constraints.
Subhash C. SarinHanif D. SheraliAjay BhootraPublished in: Oper. Res. Lett. (2005)
Keyphrases
- precedence constraints
- branch and bound algorithm
- lower bound
- upper bound
- branch and bound
- precedence relations
- subtour elimination
- single machine scheduling problem
- release dates
- scheduling problem
- lagrange interpolation
- lp relaxation
- global constraints
- vertex cover
- sequence dependent setup times
- np hard
- parallel processors
- optimal solution
- series parallel
- worst case
- approximation algorithms
- maximum lateness
- unit length
- lagrangian relaxation
- lower and upper bounds
- linear program
- search algorithm
- partially ordered sets
- objective function