Reducing Matching to Polynomial Size Linear Programming

DOI10.1137/0803035MaRDI QIDQ4277507zbMATH OpenOpenAlexFDO

Authors Francisco Barahona

Publication date 7 February 1994

Published in SIAM Journal on Optimization (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1137/0803035

zbMATH Keywords

Chinese postmancompact linear programmatchingminimum mean cycle problemspolynomial algorithmsystems of linear inequalities

Mathematics Subject Classification ID

Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Graph algorithms (graph-theoretic aspects) (05C85) Linear programming (90C05) Combinatorial optimization (90C27) Programming involving graphs or networks (90C35) Abstract computational complexity for mathematical programming problems (90C60)

Recommendations

• scientific article; zbMATH DE number 1953187
• A compact linear program for testing optimality of perfect matchings.
• Solving matching problems with linear programming
• A new algorithm for general matching problems using network flow subproblems
• Polynomial size linear programs for problems in \textsc{P}

Cited in

(16)

• Minimum mean cycle problem in bidirected and skew-symmetric graphs
• A compact linear program for testing optimality of perfect matchings.
• Edmonds, matching and the birth of polyhedral combinatorics
• Polynomial size linear programs for problems in \textsc{P}
• Solving matching problems with linear programming
• Linear Systems for Constrained Matching Problems
• scientific article; zbMATH DE number 59833 (Why is no real title available?)
• scientific article; zbMATH DE number 1953187 (Why is no real title available?)
• Using matching to detect infeasibility of some integer programs
• Maximum matching and linear programming in fixed-point logic with counting
• Extended formulations in combinatorial optimization
• Extended formulations in combinatorial optimization
• Matching 2-lattice polyhedra: Finding a maximum vector
• On cuts and matchings in planar graphs
• Two strongly polynomial cut cancelling algorithms for minimum cost network flow
• A note on the core of 2-matching games

This page was built for publication: Reducing Matching to Polynomial Size Linear Programming

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