A cutting plane approach to solve the railway traveling salesman problem

MaRDI QIDQ3392397zbMATH OpenFDO

Authors Petrica Pop, Georgia Hadjicharalambous, Christos Zaroliagis

Publication date 14 August 2009

zbMATH Keywords

integer programmingcutting planesgeneralized traveling salesman problem

Mathematics Subject Classification ID

Trees (05C05) Combinatorial optimization (90C27) Mixed integer programming (90C11)

Recommendations

• A cutting plane procedure for the travelling salesman problem on road networks
• A Branch-and-Cut Algorithm for the Symmetric Generalized Traveling Salesman Problem
• Generalized travelling salesman problem through n sets of nodes: The asymmetrical case
• The symmetric generalized traveling salesman polytope
• A cutting plane algorithm for the general routing problem

Cited in

(1)

• Mind the gap: a study of tube tour

This page was built for publication: A cutting plane approach to solve the railway traveling salesman problem

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3392397)