Matching Problems in Polymatroids Without Double Circuits

DOI10.1007/978-3-540-72792-7_14zbMath1136.90458OpenAlexW1586594910MaRDI QIDQ5429266

Gyula Pap, Márton Makai, Jácint Szabó

Publication date: 29 November 2007

Published in: Integer Programming and Combinatorial Optimization (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-540-72792-7_14

zbMATH Keywords

matroids and submodular functions

Mathematics Subject Classification ID

Matroids in convex geometry (realizations in the context of convex polytopes, convexity in combinatorial structures, etc.) (52B40) Combinatorial optimization (90C27) Combinatorial aspects of matroids and geometric lattices (05B35)

Related Items (2)

Multigraded Cayley-Chow forms ⋮ A Survey on Covering Supermodular Functions

This page was built for publication: Matching Problems in Polymatroids Without Double Circuits