Optimization over the polyhedron determined by a submodular function on a co-intersecting family

DOI10.1007/BF01589419zbMath0665.90074OpenAlexW1973651170MaRDI QIDQ1116890

Satoru Fujishige

Publication date: 1988

Published in: Mathematical Programming. Series A. Series B (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/bf01589419

zbMATH Keywords

greedy algorithmsubmodular functiondistributive latticeco-intersecting familyring familysubmodular polyhedron

Mathematics Subject Classification ID

Combinatorial optimization (90C27)

Cites Work

• Finding feasible vectors of Edmonds-Giles polyhedra
• An out-of-kilter method for submodular flows
• Generalized polymatroids and submodular flows
• Geometric algorithms and combinatorial optimization
• A NOTE ON SUBMODULAR FUNCTIONS ON DISTRIBUTIVE LATTICES
• Structures of polyhedra determined by submodular functions on crossing families
• Unnamed Item
• Unnamed Item