The cardinality constrained covering traveling salesman problem

DOI10.1016/S0305-0548(01)00084-3zbMath1029.90063OpenAlexW1969470455MaRDI QIDQ1869889

Yanyan Li

Publication date: 28 April 2003

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

Full work available at URL: https://doi.org/10.1016/s0305-0548(01)00084-3

zbMATH Keywords

heuristicsproblemcardinality constrained covering traveling salesmanHamiltonian subgraphs

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Extremal problems in graph theory (05C35) Approximation methods and heuristics in mathematical programming (90C59) Combinatorial optimization (90C27)

Related Items

A polyhedral study of the cardinality constrained multi-cycle and multi-chain problem on directed graphs ⋮ The cardinality constrained inverse center location problems on tree networks with edge length augmentation ⋮ On the kidney exchange problem: cardinality constrained cycle and chain problems on directed graphs: a survey of integer programming approaches

Cites Work

• Unnamed Item
• Unnamed Item
• The class of problems that are linearly equivalent to Satisfiability or a uniform method for proving NP-completeness
• Fast probabilistic algorithms for Hamiltonian circuits and matchings
• Estimating the Held-Karp lower bound for the geometric TSP
• Partitioning graphs into Hamiltonian ones
• A bound for the symmetric travelling salesman problem through matroid formulation
• Tabu Search and Ejection Chains—Application to a Node Weighted Version of the Cardinality-Constrained TSP
• The Traveling-Salesman Problem and Minimum Spanning Trees

This page was built for publication: The cardinality constrained covering traveling salesman problem