The cardinality constrained covering traveling salesman problem
DOI10.1016/S0305-0548(01)00084-3zbMATH Open1029.90063OpenAlexW1969470455MaRDI QIDQ1869889FDOQ1869889
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
Recommendations
Programming involving graphs or networks (90C35) Approximation methods and heuristics in mathematical programming (90C59) Combinatorial optimization (90C27) Extremal problems in graph theory (05C35)
Cites Work
- Title not available (Why is that?)
- The Traveling-Salesman Problem and Minimum Spanning Trees
- Title not available (Why is that?)
- Fast probabilistic algorithms for Hamiltonian circuits and matchings
- The class of problems that are linearly equivalent to Satisfiability or a uniform method for proving NP-completeness
- Estimating the Held-Karp lower bound for the geometric TSP
- Tabu Search and Ejection Chains—Application to a Node Weighted Version of the Cardinality-Constrained TSP
- A bound for the symmetric travelling salesman problem through matroid formulation
- Partitioning graphs into Hamiltonian ones
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)
