Mixed-Integer Vertex Covers on Bipartite Graphs
From MaRDI portal
Publication:5429277
DOI10.1007/978-3-540-72792-7_25zbMath1136.90488OpenAlexW2119063612MaRDI QIDQ5429277
Giacomo Zambelli, Bert Gerards, Michele Conforti
Publication date: 29 November 2007
Published in: Integer Programming and Combinatorial Optimization (Search for Journal in Brave)
Full work available at URL: https://research.tue.nl/nl/publications/mixedinteger-vertex-covers-on-bipartite-graphs(a3f49ae6-c44e-43d1-a84d-f3f543b558b1).html
Programming involving graphs or networks (90C35) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70)
Related Items (4)
When the Gomory-chvátal closure coincides with the integer hull ⋮ Nonunique Lifting of Integer Variables in Minimal Inequalities ⋮ On matrices with the Edmonds-Johnson property arising from bidirected graphs ⋮ On matrices with the Edmonds-Johnson property
This page was built for publication: Mixed-Integer Vertex Covers on Bipartite Graphs
