A branch and cut approach to the cardinality constrained circuit problem.
From MaRDI portal
Publication:5957568
DOI10.1007/S101070100209zbMATH Open1049.90135OpenAlexW2097355722MaRDI QIDQ5957568FDOQ5957568
Authors: P. Bauer, Jeff Linderoth, Martin W. P. Savelsbergh 
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
Recommendations
- A polyhedral study of the cardinality constrained multi-cycle and multi-chain problem on directed graphs
- Cardinality constrained minimum cut problems: complexity and algorithms.
- Weighted k‐cardinality trees: Complexity and polyhedral structure
- scientific article; zbMATH DE number 764407
- The Circuit Polytope: Facets
Programming involving graphs or networks (90C35) Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57)
Cited In (18)
- Characterization of facets of the hop constrained chain polytope via dynamic programming
- Exact Solution Algorithms for the Chordless Cycle Problem
- On the linear description of the 3-cycle polytope
- Circuit and bond polytopes on series-parallel graphs
- Polyhedral combinatorics of the cardinality constrained quadratic knapsack problem and the quadratic selective travelling salesman problem
- A polyhedral study of the cardinality constrained multi-cycle and multi-chain problem on directed graphs
- A branch-and-cut algorithm for the capacitated profitable tour problem
- Integer programming formulations for the elementary shortest path problem
- The multi‐depot family traveling salesman problem and clustered variants: Mathematical formulations and branch‐&‐cut based methods
- On solving cycle problems with branch-and-cut: extending shrinking and exact subcycle elimination separation algorithms
- On cardinality constrained cycle and path polytopes
- Facets of the \((s,t)-p\)-path polytope
- Cardinality constrained minimum cut problems: complexity and algorithms.
- Cycle selections
- On the kidney exchange problem: cardinality constrained cycle and chain problems on directed graphs: a survey of integer programming approaches
- Facets of the \(p\)-cycle polytope
- Projection results for vehicle routing
- A complete characterization of jump inequalities for the hop-constrained shortest path problem
Uses Software
This page was built for publication: A branch and cut approach to the cardinality constrained circuit problem.
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5957568)
