Heuristics for the black and white traveling salesman problem
DOI10.1016/S0305-0548(01)00082-XzbMATH Open1029.90061MaRDI QIDQ1869887FDOQ1869887
Authors: Mélanie Bourgeois, G. Laporte, F. Semet 
Publication date: 28 April 2003
Published in: Computers \& Operations Research (Search for Journal in Brave)
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
Programming involving graphs or networks (90C35) Approximation methods and heuristics in mathematical programming (90C59) Reliability, availability, maintenance, inspection in operations research (90B25) Combinatorial optimization (90C27) Communication networks in operations research (90B18)
Cites Work
Cited In (7)
- Counting feasible solutions of the traveling salesman problem with pickups and deliveries is \#\(P\)-complete
- The Black and White Traveling Salesman Problem
- Approximation Algorithms for the Black and White Traveling Salesman Problem
- The exponential multi-insertion neighborhood for the vehicle routing problem with unit demands
- 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
- Solving shortest path problems with a weight constraint and replenishment arcs
Uses Software
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)
