Two-commodity cut-packing problem

DOI10.1007/BF01584649MaRDI QIDQ5670477zbMATH OpenFDO

Authors

Publication date 1973

Published in Mathematical Programming (Search for Journal in Brave)

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

Mathematics Subject Classification ID

Integer programming (90C10) Programming involving graphs or networks (90C35)

Cites work

• Blocking and anti-blocking pairs of polyhedra

Cited in

(6)

• Distances and cuts in planar graphs
• The ellipsoid method and its consequences in combinatorial optimization
• The matroids with the max-flow min-cut property
• A two-commodity cut theorem
• Minimal multicut and maximal integer multiflow: a survey
• Total weak unimodularity: Testing and applications

This page was built for publication: Two-commodity cut-packing problem

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