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

DOI10.1016/J.EJOR.2013.11.003zbMath1305.90100OpenAlexW2071020517WikidataQ62048271 ScholiaQ62048271MaRDI QIDQ2256343

Peter Putz, Ivana Ljubić, 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

prize-collectingmatheuristic algorithmnetwork loadinglocal access

Mathematics Subject Classification ID

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

Related Items (2)

Exact algorithms for budgeted prize-collecting covering subgraph problems ⋮ Solving Steiner trees: Recent advances, challenges, and perspectives

Cites Work

• A splitter location-allocation problem in designing fiber optic access networks
• Branch-and-cut-and-price for capacitated connected facility location
• MIP models for connected facility location: a theoretical and computational study
• 0-1 reformulations of the multicommodity capacitated network design problem
• Separation algorithms for 0-1 knapsack polytopes
• Exact approaches to the single-source network loading problem
• Solving the Capacitated Local Access Network Design Problem
• A Node Splitting Technique for Two Level Network Design Problems with Transition Nodes
• A Heuristic Algorithm for a Prize-Collecting Local Access Network Design Problem
• MIP Modeling of Incremental Connected Facility Location
• Network Design Using Cut Inequalities
• Tabu search for a network loading problem with multiple facilities

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