A Primal-Dual Algorithm for Weighted Abstract Cut Packing

DOI10.1007/978-3-642-20807-2_26zbMath1341.90115OpenAlexW164749478MaRDI QIDQ3009773

S. Thomas McCormick, Britta Peis

Publication date: 24 June 2011

Published in: Integer Programming and Combinatoral Optimization (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-642-20807-2_26

Mathematics Subject Classification ID

Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57) Combinatorial optimization (90C27)

Related Items (2)

On generalizations of network design problems with degree bounds ⋮ Lattice polyhedra and submodular flows

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Integral infeasibility and testing total dual integrality
• Strongly polynomial and fully combinatorial algorithms for bisubmodular function minimization
• Decomposition of regular matroids
• Geometric algorithms and combinatorial optimization
• Increasing the rooted connectivity of a digraph by one
• Combinatorial optimization. Polyhedra and efficiency (3 volumes)
• Lattice polyhedra and submodular flows
• Submodular functions and optimization.
• Maximal Flow Through a Network
• A Polynomial Algorithm for Weighted Abstract Flow
• A generalization of max flow—min cut
• Lattice Polyhedra II: Generalization, Constructions and Examples
• Blocking and anti-blocking pairs of polyhedra

This page was built for publication: A Primal-Dual Algorithm for Weighted Abstract Cut Packing