The \(k\)-assignment polytope

DOI10.1016/J.DISOPT.2008.10.003zbMath1159.90440OpenAlexW2124504877MaRDI QIDQ1015319

Jonna Gill, Svante Linusson

Publication date: 7 May 2009

Published in: Discrete Optimization (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.disopt.2008.10.003

zbMATH Keywords

ear decompositionpartial matchingBirkhoff polytopeface posetassignment polytope

Mathematics Subject Classification ID

Discrete location and assignment (90B80) Boolean programming (90C09)

Related Items (2)

The \(k\)-assignment polytope ⋮ Good Clusterings Have Large Volume

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• The \(k\)-assignment polytope
• Matching theory
• Convex polyhedra of doubly stochastic matrices. II: Graph of Omega sub(n)
• Convex polyhedra of doubly stochastic matrices. I: Applications of the permanent function
• A proof of Parisi's conjecture on the random assignment problem
• On the expected value of the minimum assignment
• Constructive bounds and exact expectations for the random assignment problem
• The Convex Hull of Sub-Permutation Matrices
• Proofs of the Parisi and Coppersmith‐Sorkin random assignment conjectures

This page was built for publication: The \(k\)-assignment polytope