The Colorful Traveling Salesman Problem

DOI10.1007/978-0-387-48793-9_8zbMath1241.90126OpenAlexW164111053MaRDI QIDQ3439974

Edward A. Wasil, Yupei Xiong, Bruce L. Golden

Publication date: 21 May 2007

Published in: Operations Research/Computer Science Interfaces Series (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-0-387-48793-9_8

Mathematics Subject Classification ID

Approximation methods and heuristics in mathematical programming (90C59) Combinatorial optimization (90C27)

Related Items (12)

Comparison of metaheuristics for the k‐labeled spanning forest problem ⋮ The label cut problem with respect to path length and label frequency ⋮ Two heuristics for the rainbow spanning forest problem ⋮ Simpler and better approximation algorithms for the unweighted minimum label \(s\)-\(t\) cut problem ⋮ Labeled traveling salesman problems: complexity and approximation ⋮ Minimum label \(s\)-\(t\) cut has large integrality gaps ⋮ On the complexity of rainbow spanning forest problem ⋮ A branch-and-cut algorithm for the minimum labeling Hamiltonian cycle problem and two variants ⋮ The labeled maximum matching problem ⋮ The rainbow spanning forest problem ⋮ Efficient formulations for the traveling car renter problem and its quota variant ⋮ A Generic Branch-and-Cut Algorithm for Multiobjective Optimization Problems: Application to the Multilabel Traveling Salesman Problem

This page was built for publication: The Colorful Traveling Salesman Problem