A compact linear program for testing optimality of perfect matchings.

DOI10.1016/S0167-6377(03)00052-XzbMath1049.90036MaRDI QIDQ1412705

Friedrich Eisenbrand, Paolo Ventura

Publication date: 25 November 2003

Published in: Operations Research Letters (Search for Journal in Brave)

zbMATH Keywords

Matchingcompact linear programming

Mathematics Subject Classification ID

Special problems of linear programming (transportation, multi-index, data envelopment analysis, etc.) (90C08) Discrete location and assignment (90B80)

Related Items (2)

Learning in Combinatorial Optimization: What and How to Explore ⋮ Extended formulations for radial cones

Cites Work

• Unnamed Item
• Unnamed Item
• On cuts and matchings in planar graphs
• On the core of network synthesis games
• Short proofs on the matching polyhedron
• The ellipsoid method and its consequences in combinatorial optimization
• Expressing combinatorial optimization problems by linear programs
• Odd Minimum Cut-Sets and b-Matchings
• Graph Theory and Integer Programming
• Reducing Matching to Polynomial Size Linear Programming
• Matching, Euler tours and the Chinese postman
• Paths, Trees, and Flowers
• Maximum matching and a polyhedron with 0,1-vertices
• A Short Proof of the Factor Theorem for Finite Graphs

This page was built for publication: A compact linear program for testing optimality of perfect matchings.