Heuristics for the black and white traveling salesman problem
From MaRDI portal
(Redirected from Publication:1869887)
Recommendations
- The Black and White Traveling Salesman Problem
- Approximation Algorithms for the Black and White Traveling Salesman Problem
- A new formulation and approach for the black and white traveling salesman problem
- Extended formulations and branch-and-cut algorithms for the black-and-white traveling salesman problem
- The traveling salesman problem with flexible coloring
Cites work
Cited in
(7)- Solving shortest path problems with a weight constraint and replenishment arcs
- The exponential multi-insertion neighborhood for the vehicle routing problem with unit demands
- The Black and White Traveling Salesman Problem
- Extended formulations and branch-and-cut algorithms for the black-and-white traveling salesman problem
- Approximation Algorithms for the Black and White Traveling Salesman Problem
- Counting feasible solutions of the traveling salesman problem with pickups and deliveries is \#\(P\)-complete
- A new formulation and approach for the black and white traveling salesman problem
This page was built for publication: Heuristics for the black and white traveling salesman problem
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1869887)