The cardinality constrained covering traveling salesman problem

DOI10.1016/S0305-0548(01)00084-3MaRDI QIDQ1869889zbMATH OpenOpenAlexFDO

Authors 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) Approximation methods and heuristics in mathematical programming (90C59) Combinatorial optimization (90C27) Extremal problems in graph theory (05C35)

Recommendations

• Tabu Search and Ejection Chains—Application to a Node Weighted Version of the Cardinality-Constrained TSP
• The generalized covering salesman problem
• The Covering Tour Problem
• scientific article; zbMATH DE number 91020
• The time constrained maximal covering salesman problem

Cites work

• scientific article; zbMATH DE number 3898613 (Why is no real title available?)
• scientific article; zbMATH DE number 3639144 (Why is no real title available?)
• A bound for the symmetric travelling salesman problem through matroid formulation
• Estimating the Held-Karp lower bound for the geometric TSP
• Fast probabilistic algorithms for Hamiltonian circuits and matchings
• Partitioning graphs into Hamiltonian ones
• Tabu Search and Ejection Chains—Application to a Node Weighted Version of the Cardinality-Constrained TSP
• The Traveling-Salesman Problem and Minimum Spanning Trees
• The class of problems that are linearly equivalent to Satisfiability or a uniform method for proving NP-completeness

Cited in

(4)

• 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
• Length-constrained cycle partition with an application to UAV routing*
• On the kidney exchange problem: cardinality constrained cycle and chain problems on directed graphs: a survey of integer programming approaches

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1869889)