A primal-dual algorithm for weighted abstract cut packing

DOI10.1007/978-3-642-20807-2_26MaRDI QIDQ3009773zbMATH OpenOpenAlexFDO

Authors 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

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

Recommendations

• A Polynomial Algorithm for Weighted Abstract Flow
• Algorithms for submodular totally dual integral problems
• scientific article; zbMATH DE number 871948
• Primal-dual approximation algorithms for integral flow and multicut in trees
• A Primal-Dual Algorithm for Submodular Flows

Cites work

• A generalization of max flow—min cut
• A Polynomial Algorithm for Weighted Abstract Flow
• Blocking and anti-blocking pairs of polyhedra
• Combinatorial optimization. Polyhedra and efficiency (3 volumes)
• Decomposition of regular matroids
• Geometric algorithms and combinatorial optimization
• scientific article; zbMATH DE number 5764848 (Why is no real title available?)
• scientific article; zbMATH DE number 4089320 (Why is no real title available?)
• scientific article; zbMATH DE number 3691332 (Why is no real title available?)
• scientific article; zbMATH DE number 3634269 (Why is no real title available?)
• scientific article; zbMATH DE number 871948 (Why is no real title available?)
• scientific article; zbMATH DE number 3103212 (Why is no real title available?)
• Increasing the rooted connectivity of a digraph by one
• Integral infeasibility and testing total dual integrality
• Lattice polyhedra and submodular flows
• Lattice Polyhedra II: Generalization, Constructions and Examples
• Maximal Flow Through a Network
• Strongly polynomial and fully combinatorial algorithms for bisubmodular function minimization
• Submodular function minimization
• Submodular functions and optimization.

Cited in

(2)

• Lattice polyhedra and submodular flows
• Algorithms for submodular totally dual integral problems

This page was built for publication: A primal-dual algorithm for weighted abstract cut packing

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