New lower planes for the network design problem

DOI10.1002/NET.3230170202MaRDI QIDQ3792507zbMATH OpenOpenAlexFDO

Authors Ravindra K. Ahuja, V. V. S. Murty

Publication date 1987

Published in Networks (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1002/net.3230170202

zbMATH Keywords

branch and boundlinear lower approximationlower planenetwork design problem

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Deterministic network models in operations research (90B10) Combinatorial optimization (90C27) Programming involving graphs or networks (90C35)

Recommendations

• Lower bounding techniques for the degree-constrained network design problem
• Network design problem with cut constraints
• A Capacity Improvement Lower Bound for Fixed Charge Network Design Problems
• Computational Results with a Cutting Plane Algorithm for Designing Communication Networks with Low-Connectivity Constraints
• scientific article; zbMATH DE number 1184420

Cited in

(1)

• Lower bounding techniques for the degree-constrained network design problem

This page was built for publication: New lower planes for the network design problem

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