The Two Level Network Design Problem with Secondary Hop Constraints

DOI10.1007/978-3-642-21527-8_9MaRDI QIDQ3091484zbMATH OpenOpenAlexWikidataFDO

Authors Stefan Gollowitzer, Luis Gouveia, Ivana Ljubić

Publication date 9 September 2011

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-642-21527-8_9

Mathematics Subject Classification ID

Deterministic network models in operations research (90B10) Discrete location and assignment (90B80) Programming involving graphs or networks (90C35)

Recommendations

• The two layer network design problem
• The two-edge connected hop-constrained network design problem: Valid inequalities and branch-and-cut
• The hierarchical network design problem with multiple primary paths
• A Dual-Based Algorithm for Multi-Level Network Design
• Network design problem with congestion effects: A case of bilevel programming
• scientific article; zbMATH DE number 4202052
• Network-related problems in optimal experimental design and second order cone programming
• The convex hull of two core capacitated network design problems
• Hop constrained network design problem with partial survivability
• Modeling and Heuristic Worst-Case Performance Analysis of the Two-Level Network Design Problem

Cited in

(4)

• The hierarchical network design problem with multiple primary paths
• Network-related problems in optimal experimental design and second order cone programming
• A Node Splitting Technique for Two Level Network Design Problems with Transition Nodes
• New valid inequalities for the optimal communication spanning tree problem

This page was built for publication: The Two Level Network Design Problem with Secondary Hop Constraints

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