Heuristics for the black and white traveling salesman problem

Computers and Operations Research

Volumn 30, Issue 1, 2003, Pages 75-85

  Bourgeois, Mélanie ^a   Laporte, Gilbert ^a   Semet, Frédéric ^a,b  

^a HEC MONTRÉAL   (Canada)

^b UNIVERSITÉ DE VALENCIENNES   (France)

Author keywords

Aircraft maintenance stops; Heuristics; Telecommunication network design; Traveling salesman problem

Indexed keywords

CONSTRAINT THEORY; GRAPH THEORY; HAMILTONIANS; HEURISTIC METHODS;

VERTEX SET;

TRAVELING SALESMAN PROBLEM;

HEURISTICS;

EID: 0037211455     PISSN: 03050548     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0305-0548(01)00082-X     Document Type: Article

References (8)

1. An algorithm for designing rings in survivable fiber networks
2. SONET toolkit: A decision support system for designing robust and cost-effective fiber-optic networks
3. Design and dimensioning of survivable SDH/SONET networks
4. The four-day aircraft maintenance routing problem
5. Heuristic approaches to the asymmetric travelling salesman problem with replenishment arcs
6. New insertion and postoptimization procedures for the traveling salesman problem
7. A method for solving traveling-salesman problems
8. Computer solutions of the traveling salesman problem