Optimizing over a slice of the bipartite matching polytope

DOI10.1016/0012-365X(88)90143-4zbMath0658.90090OpenAlexW1969175178MaRDI QIDQ1111947

Matthias Leclerc

Publication date: 1989

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

Full work available at URL: https://doi.org/10.1016/0012-365x(88)90143-4

zbMATH Keywords

polynomial solutionExact Perfect Matching

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Analysis of algorithms and problem complexity (68Q25) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Polytopes and polyhedra (52Bxx)

Related Items (2)

On generalized balanced optimization problems ⋮ A polynomial time equivalence between DNA sequencing and the exact perfect matching problem

Cites Work

• Unnamed Item
• Exact arborescences, matchings and cycles
• On minimal elementary bipartite graphs
• The complexity of restricted spanning tree problems

This page was built for publication: Optimizing over a slice of the bipartite matching polytope