Lower bounding techniques for the degree-constrained network design problem

DOI10.1002/NET.20287MaRDI QIDQ3057091zbMATH OpenOpenAlexFDO

Authors Güvenç Şahin, Ravindra K. Ahuja

Publication date 24 November 2010

Published in Networks (Search for Journal in Brave)

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

zbMATH Keywords

branch-and-bounddegree constraintslower boundslower planesnetwork design problemsrailroad scheduling

Mathematics Subject Classification ID

Deterministic network models in operations research (90B10) Traffic problems in operations research (90B20) Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57)

Recommendations

• New lower planes for the network design problem
• Network design problem with cut constraints
• A Capacity Improvement Lower Bound for Fixed Charge Network Design Problems
• Network-design with degree constraints
• On some network design problems with degree constraints

Cites work

• A capacity allocation problem with integer side constraints
• A Computational Approach to the Selection of an Optimal Network
• A Lagrangian Heuristic Based Branch-and-Bound Approach for the Capacitated Network Design Problem
• Approximation algorithms for degree-constrained minimum-cost network-design problems
• Constructing railroad blocking plans to minimize handling costs
• scientific article; zbMATH DE number 3639144 (Why is no real title available?)
• Lower planes for the network design problem
• Network flows. Theory, algorithms, and applications.
• New lower planes for the network design problem
• Optimal Solution of Vehicle Routing Problems Using Minimum K-Trees
• Solving the uncapacitated network design problem by a Lagrangean heuristic and branch-and-bound
• The complexity of the network design problem

Cited in

(3)

• Network design problem with cut constraints
• A Capacity Improvement Lower Bound for Fixed Charge Network Design Problems
• New lower planes for the network design problem

This page was built for publication: Lower bounding techniques for the degree-constrained network design problem

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