A MIP-based approach to solve the prize-collecting local access network design problem

DOI10.1016/J.EJOR.2013.11.003MaRDI QIDQ2256343zbMATH OpenOpenAlexWikidataFDO

Authors Ivana Ljubić, Peter Putz, Juan-José Salazar-González

Publication date 19 February 2015

Published in European Journal of Operational Research (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/j.ejor.2013.11.003

zbMATH Keywords

local accessmatheuristic algorithmnetwork loadingprize-collecting

Mathematics Subject Classification ID

Communication networks in operations research (90B18) Mixed integer programming (90C11) Combinatorial optimization (90C27) Approximation methods and heuristics in mathematical programming (90C59)

Recommendations

• A heuristic algorithm for a prize-collecting local access network design problem
• Solving the capacitated local access network design problem
• Approximation Algorithms for Prize-Collecting Network Design Problems with General Connectivity Requirements
• Approximation algorithms for prize-collecting capacitated network design problems
• A comparison of optimal methods for local access uncapacitated network design
• Model and heuristic for a generalized access network design problem
• Dynamic programming based heuristics for the topological design of local access networks
• Solving a continuous local access network design problem with a stabilized central column generation approach
• A local branching heuristic for the capacitated fixed-charge network design problem
• A dynamic programming algorithm for the local access telecommunication network expansion problem

Cites work

• 0-1 reformulations of the multicommodity capacitated network design problem
• A heuristic algorithm for a prize-collecting local access network design problem
• A Node Splitting Technique for Two Level Network Design Problems with Transition Nodes
• A splitter location-allocation problem in designing fiber optic access networks
• Branch-and-cut-and-price for capacitated connected facility location
• Exact approaches to the single-source network loading problem
• MIP modeling of incremental connected facility location
• MIP models for connected facility location: a theoretical and computational study
• Network Design Using Cut Inequalities
• Separation algorithms for 0-1 knapsack polytopes
• Solving the capacitated local access network design problem
• Tabu search for a network loading problem with multiple facilities

Cited in

(4)

• Exact algorithms for budgeted prize-collecting covering subgraph problems
• A heuristic algorithm for a prize-collecting local access network design problem
• Solving Steiner trees: Recent advances, challenges, and perspectives
• Solving a continuous local access network design problem with a stabilized central column generation approach

This page was built for publication: A MIP-based approach to solve the prize-collecting local access network design problem

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