Solving the capacitated local access network design problem

DOI10.1287/IJOC.1070.0237MaRDI QIDQ2901009zbMATH OpenOpenAlexFDO

Authors 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)

Recommendations

• Approximation algorithms for a capacitated network design problem
• A comparison of optimal methods for local access uncapacitated network design
• scientific article; zbMATH DE number 1264406
• scientific article; zbMATH DE number 1670539
• New modeling approaches for the design of local access transport area networks

Cited in

(24)

• Exact approaches to the single-source network loading problem
• Solving local access network design problem with two technologies
• A MIP-based approach to solve the prize-collecting local access network design problem
• Network flow models for the local access network expansion problem
• Network installation under convex costs
• Models for the piecewise linear unsplittable multicommodity flow problems
• A comparison of optimal methods for local access uncapacitated network design
• Exact approaches for designing multifacility buy-at-bulk networks
• Valid inequalities and facets for multi‐module survivable network design problem
• A polynomial local optimality condition for the concave piecewise linear network flow problem
• Redundancy system design for an aircraft door management system
• Tree knapsack approaches for local access network design
• A cutting plane algorithm for the capacitated connected facility location problem
• A node rooted flow-based model for the local access network expansion problem
• A splitter location-allocation problem in designing fiber optic access networks
• An exact separation algorithm for unsplittable flow capacitated network design arc-set polyhedron
• A knowledge-based approach to the local area network design problem
• Solving a continuous local access network design problem with a stabilized central column generation approach
• Solving network design problems via iterative aggregation
• 0-1 reformulations of the multicommodity capacitated network design problem
• A mixed-integer optimization formulation for buyer formation
• Towards optimizing the deployment of optical access networks
• New modeling approaches for the design of local access transport area networks
• Optimizing splitter and fiber location in a multilevel optical FTTH network

This page was built for publication: Solving the capacitated local access network design problem

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