Tree network design avoiding congestion

DOI10.1016/j.apm.2011.02.046zbMath1225.90015OpenAlexW1995967941MaRDI QIDQ646180

L. R. Pinto, Henrique Pacca Loureiro Luna, Ricardo S. de Camargo, G. jun. Miranda

Publication date: 11 November 2011

Published in: Applied Mathematical Modelling (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.apm.2011.02.046

zbMATH Keywords

generalized Benders decompositionmixed-integer nonlinear programmingSteiner tree problemsmulti-commodity network design flow problems

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Small world graphs, complex networks (graph-theoretic aspects) (05C82) Mixed integer programming (90C11) Deterministic network models in operations research (90B10)

Related Items (3)

Upgrading nodes in tree-shaped hub location ⋮ On the economic sustainability of supplying bandwidth policies in multi-layer wireless cognitive networks ⋮ Application of Benders decomposition method in solution of a fixed-charge multicommodity network design problem avoiding congestion

Uses Software

• SteinLib

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Heuristics for distribution network design in telecommunication
• Telecommunication network capacity design for uncertain demand
• B\&B frameworks for the capacity expansion of high speed telecommunication networks under uncertainty
• Multiple allocation hub-and-spoke network design under hub congestion
• Tight bounds from a path based formulation for the tree of hub location problem
• A route set construction algorithm for the transit network design problem
• The tree of hubs location problem
• The telephonic switching centre network problem: Formalization and computational experience
• Partitioning procedures for solving mixed-variables programming problems
• Topological design of telecommunication networks --- local access design methods
• A characterization of the uncapacitated network design polytope
• The Steiner tree problem
• Bounds for global optimization of capacity expansion and flow assignment problems
• A comparison of optimal methods for local access uncapacitated network design
• A survey on Benders decomposition applied to fixed-charge network design problems
• Generalized Benders decomposition
• A dual ascent approach for steiner tree problems on a directed graph
• Tailoring Benders decomposition for uncapacitated network design
• Steiner problem in networks: A survey
• An SST-based algorithm for the steiner problem in graphs
• Analysis of a flow problem with fixed charges
• An integer linear programming approach to the steiner problem in graphs
• Topological design of centralized computer networks—formulations and algorithms
• Multicommodity Distribution System Design by Benders Decomposition
• Large-Scale Network Topological Optimization
• A branch and cut algorithm for the Steiner problem in graphs
• Solving Steiner tree problems in graphs to optimality
• Formulations and Algorithms for the Capacitated Minimal Directed Tree Problem
• A catalog of steiner tree formulations
• The One-Terminal TELPAK Problem
• A generalized upper bounding algorithm for multicommodity network flow problems
• An algorithm for the steiner problem in graphs
• The projected pairwise multicommodity flow polyhedron
• A multicast tree construction algorithm for large multiparty conferences
• Cored-based tree with forwarding regions (CBT-FR); a protocol for reliable multicasting in mobile ad hoc networks
• Steiner tree problems

This page was built for publication: Tree network design avoiding congestion