A branch and cut approach to the cardinality constrained circuit problem.
From MaRDI portal
Publication:5957568
DOI10.1007/s101070100209zbMath1049.90135OpenAlexW2097355722MaRDI QIDQ5957568
No author found.
Publication date: 2002
Published in: Mathematical Programming. Series A. Series B (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s101070100209
Programming involving graphs or networks (90C35) Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57)
Related Items (17)
Integer programming formulations for the elementary shortest path problem ⋮ A polyhedral study of the cardinality constrained multi-cycle and multi-chain problem on directed graphs ⋮ Cycle selections ⋮ The multi‐depot family traveling salesman problem and clustered variants: Mathematical formulations and branch‐&‐cut based methods ⋮ Exact Solution Algorithms for the Chordless Cycle Problem ⋮ On solving cycle problems with branch-and-cut: extending shrinking and exact subcycle elimination separation algorithms ⋮ On the kidney exchange problem: cardinality constrained cycle and chain problems on directed graphs: a survey of integer programming approaches ⋮ Circuit and bond polytopes on series-parallel graphs ⋮ A complete characterization of jump inequalities for the hop-constrained shortest path problem ⋮ Polyhedral combinatorics of the cardinality constrained quadratic knapsack problem and the quadratic selective travelling salesman problem ⋮ On cardinality constrained cycle and path polytopes ⋮ Facets of the \((s,t)-p\)-path polytope ⋮ Facets of the \(p\)-cycle polytope ⋮ Characterization of facets of the hop constrained chain polytope via dynamic programming ⋮ A branch-and-cut algorithm for the capacitated profitable tour problem ⋮ Projection results for vehicle routing ⋮ On the linear description of the 3-cycle polytope
Uses Software
This page was built for publication: A branch and cut approach to the cardinality constrained circuit problem.
