New formulation for the high multiplicity asymmetric traveling salesman problem with application to the Chesapeake problem

DOI10.1007/s11590-010-0205-yzbMath1220.90111MaRDI QIDQ537638

Sarin, Subhash C., Hanif D. Sherali, Liming Yao

Publication date: 20 May 2011

Published in: Optimization Letters (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s11590-010-0205-y

zbMATH Keywords

parallel machine scheduling; lot-sizing; Chesapeake problem; high multiplicity asymmetric traveling salesman problem; polynomial-length formulation

Mathematics Subject Classification ID

90C27: Combinatorial optimization

Related Items

Modeling lotsizing and scheduling problems with sequence dependent setups, Pricing, relaxing and fixing under lot sizing and scheduling

Cites Work

• The capacitated lot-sizing and scheduling problem with sequence-dependent setup costs and setup times
• The discrete lot-sizing and scheduling problem with sequence-dependent setup costs
• Simultaneous lotsizing and scheduling on parallel machines
• Scheduling injection molding operations with multiple resource constraints and sequence dependent setup times and costs
• New tighter polynomial length formulations for the asymmetric traveling salesman problem with and without precedence constraints
• A class of lifted path and flow-based formulations for the asymmetric traveling salesman problem with and without precedence constraints
• On the high multiplicity traveling salesman problem
• Modelling Practical Lot-Sizing Problems as Mixed-Integer Programs
• Lotsizing and Scheduling on Parallel Machines with Sequence-Dependent Setup Costs
• The Traveling Salesman Problem with Many Visits to Few Cities