A compact linear program for testing optimality of perfect matchings.
type: Item
instance of: scholarly article
title: A compact linear program for testing optimality of perfect matchings.
zbMATH Open document ID: 1049.90036
DOI: 10.1016/S0167-6377(03)00052-X
author: P. Ventura
author: Friedrich Eisenbrand
published in: Operations Research Letters
publication date: 2003-11-25T00:00:00Z
Mathematics Subject Classification ID: 90B80
Mathematics Subject Classification ID: 90C08
zbMATH DE Number: 2009194
zbMATH Keywords: Matching
zbMATH Keywords: compact linear programming
MaRDI profile type: Publication
cites work: On cuts and matchings in planar graphs
cites work: Reducing Matching to Polynomial Size Linear Programming
cites work: Maximum matching and a polyhedron with 0,1-vertices
cites work: Paths, Trees, and Flowers
cites work: Matching, Euler tours and the Chinese postman
cites work: The ellipsoid method and its consequences in combinatorial optimization
cites work: Graph Theory and Integer Programming
cites work: Odd Minimum Cut-Sets and b-Matchings
cites work: Short proofs on the matching polyhedron
cites work: Q3818127
cites work: Q3916595
cites work: On the core of network synthesis games
cites work: A Short Proof of the Factor Theorem for Finite Graphs
cites work: Expressing combinatorial optimization problems by linear programs
description: scientific article; zbMATH DE number 2009194