Computational experience with a difficult mixed-integer multicommodity flow problem

MaRDI QIDQ1804363zbMATH OpenFDO

Authors Daniel Bienstock, Oktay Günlük

Publication date 18 April 1996

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

zbMATH Keywords

combined design/routing problemcutting plane algorithmlightwave networks

Mathematics Subject Classification ID

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

Recommendations

• Capacitated Network Design—Polyhedral Structure and Computation
• Computational Results with a Cutting Plane Algorithm for Designing Communication Networks with Low-Connectivity Constraints
• A polyhedral approach to an integer multicommodity flow problem
• scientific article; zbMATH DE number 647749

Cited in

(9)

• 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
• 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
• Multicommodity network flows: a survey. I: Applications and formulations
• JuMP: a modeling language for mathematical optimization
• Technique for transforming discrete optimization problems into QUBO form
• Maximizing residual capacity in connection-oriented networks

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

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