Two-commodity cut-packing problem

DOI10.1007/BF01584649zbMath0255.90067MaRDI QIDQ5670477

No author found.

Publication date: 1973

Published in: Mathematical Programming (Search for Journal in Brave)

Mathematics Subject Classification ID

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

Related Items

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

Cites Work

• Blocking and anti-blocking pairs of polyhedra