Heuristics for the black and white traveling salesman problem

DOI10.1016/S0305-0548(01)00082-XzbMath1029.90061MaRDI QIDQ1869887

Mélanie Bourgeois, Frédéric Semet, Gilbert Laporte

Publication date: 28 April 2003

Published in: Computers \& Operations Research (Search for Journal in Brave)

zbMATH Keywords

HeuristicsTraveling salesman problemtelecommunication network designaircraft maintenance stops

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Communication networks in operations research (90B18) Approximation methods and heuristics in mathematical programming (90C59) Reliability, availability, maintenance, inspection in operations research (90B25) Combinatorial optimization (90C27)

Related Items (5)

A new formulation and approach for the black and white traveling salesman problem ⋮ The exponential multi-insertion neighborhood for the vehicle routing problem with unit demands ⋮ 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 ⋮ Counting feasible solutions of the traveling salesman problem with pickups and deliveries is \#\(P\)-complete

Uses Software

• SONET

Cites Work

• The Four-Day Aircraft Maintenance Routing Problem
• An algorithm for designing rings for survivable fiber networks
• New Insertion and Postoptimization Procedures for the Traveling Salesman Problem
• A Method for Solving Traveling-Salesman Problems
• Computer Solutions of the Traveling Salesman Problem

This page was built for publication: Heuristics for the black and white traveling salesman problem