Solving the Capacitated Local Access Network Design Problem

DOI10.1287/IJOC.1070.0237zbMath1243.90034OpenAlexW2155214749MaRDI QIDQ2901009

F. Sibel Salman, R. Ravi, John N. Hooker

Publication date: 28 July 2012

Published in: INFORMS Journal on Computing (Search for Journal in Brave)

Full work available at URL: https://semanticscholar.org/paper/040235f64faba896b7bc4c3d1d410c62e9f7b9ff

zbMATH Keywords

branch and boundnetwork designroutingflow capacity

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57) Deterministic network models in operations research (90B10)

Related Items (13)

Exact approaches to the single-source network loading problem ⋮ A polynomial local optimality condition for the concave piecewise linear network flow problem ⋮ Redundancy system design for an aircraft door management system ⋮ A cutting plane algorithm for the capacitated connected facility location problem ⋮ Optimizing splitter and fiber location in a multilevel optical FTTH network ⋮ Valid inequalities and facets for multi‐module survivable network design problem ⋮ Exact Approaches for Designing Multifacility Buy-at-Bulk Networks ⋮ Models for the piecewise linear unsplittable multicommodity flow problems ⋮ A splitter location-allocation problem in designing fiber optic access networks ⋮ A MIP-based approach to solve the prize-collecting local access network design problem ⋮ Towards optimizing the deployment of optical access networks ⋮ An exact separation algorithm for unsplittable flow capacitated network design arc-set polyhedron ⋮ 0-1 reformulations of the multicommodity capacitated network design problem

This page was built for publication: Solving the Capacitated Local Access Network Design Problem