Lattice polyhedra and submodular flows

DOI10.1007/s13160-012-0084-yzbMath1262.90103OpenAlexW1972568950MaRDI QIDQ1926644

Britta Peis, Satoru Fujishige

Publication date: 28 December 2012

Published in: Japan Journal of Industrial and Applied Mathematics (Search for Journal in Brave)

Full work available at URL: http://hdl.handle.net/2433/167739

zbMATH Keywords

distributive latticeslattice polyhedraEdmonds-Giles polyhedra

Mathematics Subject Classification ID

Lattice polytopes in convex geometry (including relations with commutative algebra and algebraic geometry) (52B20) Integer programming (90C10) Structure and representation theory of distributive lattices (06D05) Modular lattices, Desarguesian lattices (06C05)

Related Items

A Primal-Dual Algorithm for Weighted Abstract Cut Packing

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• A fast cost scaling algorithm for submodular flow
• Strongly polynomial and fully combinatorial algorithms for bisubmodular function minimization
• Increasing the rooted connectivity of a digraph by one
• On the core of ordered submodular cost games
• A faster capacity scaling algorithm for minimum cost submodular flow
• Combinatorial optimization. Polyhedra and efficiency (3 volumes)
• Submodular linear programs on forests
• Structural aspects of ordered polymatroids
• Submodular functions and optimization.
• A General Class of Greedily Solvable Linear Programs
• A Primal-Dual Algorithm for Weighted Abstract Cut Packing
• Structures of polyhedra determined by submodular functions on crossing families
• Lattice Polyhedra II: Generalization, Constructions and Examples