The Black and White Traveling Salesman Problem

DOI10.1287/opre.1050.0218zbMath1167.90666OpenAlexW1970974711MaRDI QIDQ3391982

Gianpaolo Ghiani, Gilbert Laporte, Frédéric Semet

Publication date: 13 August 2009

Published in: Operations Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1287/opre.1050.0218

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Traffic problems in operations research (90B20)

Related Items (9)

A new formulation and approach for the black and white traveling salesman problem ⋮ A polyhedral study of the cardinality constrained multi-cycle and multi-chain problem on directed graphs ⋮ The exponential multi-insertion neighborhood for the vehicle routing problem with unit demands ⋮ A branch-cut-and-price algorithm for the traveling salesperson problem with hotel selection ⋮ Extended formulations and branch-and-cut algorithms for the black-and-white traveling salesman problem ⋮ Minimizing customers' waiting time in a vehicle routing problem with unit demands ⋮ Solving shortest path problems with a weight constraint and replenishment arcs ⋮ Minimum cost path problems with relays ⋮ The aircraft maintenance base location problem

This page was built for publication: The Black and White Traveling Salesman Problem