Optimum partitioning into intersections of ring families

DOI10.1016/S0166-218X(96)00118-7MaRDI QIDQ1363743zbMATH OpenOpenAlexFDO

Authors 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)

Recommendations

• On the attack problem for a family of subsets
• Lattice matrices, intersection of ring families and dicuts
• A unidirectional ring partition problem

Cites work

• scientific article; zbMATH DE number 4191655 (Why is no real title available?)
• scientific article; zbMATH DE number 3862931 (Why is no real title available?)
• scientific article; zbMATH DE number 3580570 (Why is no real title available?)
• scientific article; zbMATH DE number 3634269 (Why is no real title available?)
• A Primal-Dual Algorithm for Submodular Flows
• An Algorithm for Submodular Functions on Graphs
• Finding feasible vectors of Edmonds-Giles polyhedra
• Lattice Polyhedra II: Generalization, Constructions and Examples
• Lattice matrices, intersection of ring families and dicuts
• Maximal Closure of a Graph and Applications to Combinatorial Problems
• Minimum cuts, modular functions, and matroid polyhedra
• Path-closed sets

Cited in

(2)

• On the attack problem for a family of subsets
• Lattice matrices, intersection of ring families and dicuts

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1363743)