Computational experience with a difficult mixed-integer multicommodity flow problem

zbMath0834.90054MaRDI QIDQ1804363

Bienstock, Daniel, Oktay Günlük

Publication date: 18 April 1996

Published in: Mathematical Programming. Series A. Series B (Search for Journal in Brave)

zbMATH Keywords

cutting plane algorithmcombined design/routing problemlightwave networks

Mathematics Subject Classification ID

Mixed integer programming (90C11) Deterministic network models in operations research (90B10)

Related Items (8)

On minimum congestion routing in rearrangeable multihop lightwave networks ⋮ New partial aggregations for multicommodity network flow problems: an application to the fixed-charge network design problem ⋮ Unnamed Item ⋮ Maximizing residual capacity in connection-oriented networks ⋮ JuMP: A Modeling Language for Mathematical Optimization ⋮ Using rank-1 lift-and-project closures to generate cuts for 0-1 MIPs, a computational investigation ⋮ 0-1 reformulations of the multicommodity capacitated network design problem ⋮ Minimum cost capacity installation for multicommodity network flows

This page was built for publication: Computational experience with a difficult mixed-integer multicommodity flow problem