A branch and cut approach to the cardinality constrained circuit problem.

DOI10.1007/S101070100209MaRDI QIDQ5957568zbMATH OpenOpenAlexFDO

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

zbMATH Keywords

circuit polytope

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57)

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

Cited in

(19)

• Cardinality constrained minimum cut problems: complexity and algorithms.
• On the linear description of the 3-cycle polytope
• A polyhedral study of the cardinality constrained multi-cycle and multi-chain problem on directed graphs
• Circuit and bond polytopes on series-parallel graphs
• On solving cycle problems with branch-and-cut: extending shrinking and exact subcycle elimination separation algorithms
• A branch-and-cut algorithm for the capacitated profitable tour problem
• Polyhedral combinatorics of the cardinality constrained quadratic knapsack problem and the quadratic selective travelling salesman problem
• Projection results for vehicle routing
• Integer programming formulations for the elementary shortest path problem
• Exact Solution Algorithms for the Chordless Cycle Problem
• On the kidney exchange problem: cardinality constrained cycle and chain problems on directed graphs: a survey of integer programming approaches
• A complete characterization of jump inequalities for the hop-constrained shortest path problem
• Facets of the p-cycle polytope
• Cycle selections
• The multi‐depot family traveling salesman problem and clustered variants: Mathematical formulations and branch‐&‐cut based methods
• Formulations and algorithms for the simple cycle problem
• Characterization of facets of the hop constrained chain polytope via dynamic programming
• On cardinality constrained cycle and path polytopes
• Facets of the (s,t)-p-path polytope

Describes a project that uses

Uses Software

• TSPLIB
• MINTO

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)