Optimum partitioning into intersections of ring families

DOI10.1016/S0166-218X(96)00118-7zbMATH Open0882.90099OpenAlexW2052609588MaRDI QIDQ1363743FDOQ1363743

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

Recommendations

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

zbMATH Keywords

polyhedral combinatoricslattice matricessubmodular flowsminimum partitioning

Mathematics Subject Classification ID

Integer programming (90C10)

Cites Work

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

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)