Multiple asymmetric traveling salesmen problem with and without precedence constraints: Performance comparison of alternative formulations.
Subhash C. SarinHanif D. SheraliJason D. JuddPei-Fang Jennifer TsaiPublished in: Comput. Oper. Res. (2014)
Keyphrases
- precedence constraints
- alternative formulations
- branch and bound algorithm
- scheduling problem
- vertex cover
- parallel machines
- single machine scheduling problem
- statistical analysis
- approximation algorithms
- limited capacity
- bayesian networks
- objective function
- traveling salesman problem
- partial order
- parallel processors
- precedence relations