On the high multiplicity traveling salesman problem
From MaRDI portal
(Redirected from On the high multiplicity traveling salesman problem)
Recommendations
Cites work
- Arc Routing Problems, Part I: The Chinese Postman Problem
- Flowshop scheduling with limited temporary storage
- scientific article; zbMATH DE number 4089320 (Why is no real title available?)
- scientific article; zbMATH DE number 193411 (Why is no real title available?)
- scientific article; zbMATH DE number 3639144 (Why is no real title available?)
- Integer Programming with a Fixed Number of Variables
- Low-complexity algorithms for sequencing jobs with a fixed number of job-classes
- No-wait flow shop scheduling with large lot sizes
- Parallel machine scheduling with high multiplicity
- Strongly Polynomial Algorithms for the High Multiplicity Scheduling Problem
- The Traveling Salesman Problem with Many Visits to Few Cities
Cited in
(11)- The product rate variation problem and its relevance in real world mixed-model assembly lines
- Scheduling electric vehicles and locating charging stations on a path
- The multi-stripe travelling salesman problem
- High multiplicity asymmetric traveling salesman problem with feedback vertex set and its application to storage/retrieval system
- Many-visits TSP revisited
- Multiobjective traveling salesperson problem on Halin graphs
- The centred travelling salesman at high temperature
- On the Travelling Salesperson Problem in Many Dimensions
- 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
This page was built for publication: On the high multiplicity traveling salesman problem
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2494812)