Optimum partitioning into intersections of ring families

DOI10.1016/S0166-218X(96)00118-7zbMath0882.90099OpenAlexW2052609588MaRDI QIDQ1363743

Maurice Cochand, Arlette Gaillard, Heinz Groeflin

Publication date: 11 August 1997

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

Full work available at URL: http://www.elsevier.com/locate/dam

zbMATH Keywords

polyhedral combinatoricslattice matricessubmodular flowsminimum partitioning

Mathematics Subject Classification ID

Integer programming (90C10)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Finding feasible vectors of Edmonds-Giles polyhedra
• Path-closed sets
• Lattice matrices, intersection of ring families and dicuts
• A Primal-Dual Algorithm for Submodular Flows
• Minimum cuts, modular functions, and matroid polyhedra
• Maximal Closure of a Graph and Applications to Combinatorial Problems
• An Algorithm for Submodular Functions on Graphs
• Lattice Polyhedra II: Generalization, Constructions and Examples

This page was built for publication: Optimum partitioning into intersections of ring families