The Black and White Traveling Salesman Problem
From MaRDI portal
Publication:3391982
Recommendations
- Heuristics 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
- Approximation Algorithms for the Black and White Traveling Salesman Problem
- The traveling salesman problem with flexible coloring
Cited in
(14)- Exact algorithms for the equitable traveling salesman problem
- The aircraft maintenance base location problem
- Minimizing customers' waiting time in a vehicle routing problem with unit demands
- Approximation Algorithms for the Black and White Traveling Salesman Problem
- The traveling salesman problem with flexible coloring
- A polyhedral study of the cardinality constrained multi-cycle and multi-chain problem on directed graphs
- A branch-cut-and-price algorithm for the traveling salesperson problem with hotel selection
- 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
- Minimum cost path problems with relays
- Corrigendum to: ``Extended formulations and branch-and-cut algorithms 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
- Heuristics for the black and white traveling salesman problem
This page was built for publication: 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 Q3391982)