On the high multiplicity traveling salesman problem

DOI10.1016/j.disopt.2005.11.002zbMath1110.90074OpenAlexW2038071774WikidataQ57338958 ScholiaQ57338958MaRDI QIDQ2494812

Alexander Grigoriev, Joris van de Klundert

Publication date: 30 June 2006

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

Full work available at URL: https://doi.org/10.1016/j.disopt.2005.11.002

zbMATH Keywords

high multiplicitytraveling salesman problem

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57) Combinatorial optimization (90C27)

Related Items (7)

Scheduling electric vehicles and locating charging stations on a path ⋮ A 3/2-Approximation for the Metric Many-Visits Path TSP ⋮ New formulation for the high multiplicity asymmetric traveling salesman problem with application to the Chesapeake problem ⋮ Multiplicity and complexity issues in contemporary production scheduling ⋮ High multiplicity asymmetric traveling salesman problem with feedback vertex set and its application to storage/retrieval system ⋮ The product rate variation problem and its relevance in real world mixed-model assembly lines ⋮ Many-visits TSP revisited

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• No-wait flow shop scheduling with large lot sizes
• Low-complexity algorithms for sequencing jobs with a fixed number of job-classes
• Integer Programming with a Fixed Number of Variables
• The Traveling Salesman Problem with Many Visits to Few Cities
• Flowshop scheduling with limited temporary storage
• Strongly Polynomial Algorithms for the High Multiplicity Scheduling Problem
• Arc Routing Problems, Part I: The Chinese Postman Problem
• Parallel machine scheduling with high multiplicity

This page was built for publication: On the high multiplicity traveling salesman problem