A cutting plane algorithm for the capacitated connected facility location problem
DOI10.1007/S10589-013-9544-9zbMATH Open1275.90036OpenAlexW2057635030WikidataQ62048274 ScholiaQ62048274MaRDI QIDQ2393652FDOQ2393652
Stefan Gollowitzer, Ivana Ljubić, Bernard Gendron
Publication date: 8 August 2013
Published in: Computational Optimization and Applications (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10589-013-9544-9
Recommendations
- Branch-and-cut-and-price for capacitated connected facility location
- Capacitated facility location/network design problems.
- Modeling and Solving the Two-Facility Capacitated Network Loading Problem
- The incremental connected facility location problem
- Capacitated Network Design—Polyhedral Structure and Computation
facility locationtelecommunicationsconnected facility locationcapacitated network designmixed integer programming models
Mixed integer programming (90C11) Communication networks in operations research (90B18) Discrete location and assignment (90B80)
Cites Work
- An exact algorithm for the capacitated facility location problems with single sourcing
- Separation algorithms for 0-1 knapsack polytopes
- Scatter search for the single source capacitated facility location problem
- Hybrid metaheuristics. 4th international workshop, HM 2007, Dortmund, Germany, October 8--9, 2007. Proceedings
- Dual-based local search for the connected facility location and related problems
- Cycle-Based Neighbourhoods for Fixed-Charge Capacitated Multicommodity Network Design
- A Simplex-Based Tabu Search Method for Capacitated Network Design
- A Branch-and-Price algorithm for the Single Source Capacitated Plant Location Problem
- MIP models for connected facility location: a theoretical and computational study
- Capacitated Facility Location: Valid Inequalities and Facets
- Connected facility location via random facility sampling and core detouring
- Combining exact and heuristic approaches for the capacitated fixed-charge network flow problem
- Bundle-based relaxation methods for multicommodity capacitated fixed charge network design
- A local branching heuristic for the capacitated fixed-charge network design problem
- MIP Modeling of Incremental Connected Facility Location
- A Lagrangian Heuristic Based Branch-and-Bound Approach for the Capacitated Network Design Problem
- Benders, metric and cutset inequalities for multicommodity capacitated network design
- Path relinking, cycle-based neighbourhoods and capacitated multicommodity network design
- A capacity scaling heuristic for the multicommodity capacitated network design problem
- A computational evaluation of a general branch-and-price framework for capacitated network location problems
- Branch-and-cut-and-price for capacitated connected facility location
- Solving the capacitated local access network design problem
- A slope scaling/Lagrangean perturbation heuristic with long-term memory for multicommodity capacitated fixed-charge network design
- Title not available (Why is that?)
- Algorithms – ESA 2005
- Exact approaches to the single-source network loading problem
- Branch-and-price-and-cut for large-scale multicommodity capacitated fixed-charge network design
- The impact of filtering in a branch-and-cut algorithm for multicommodity capacitated fixed charge network design
Cited In (12)
- Capacitated facility location/network design problems.
- Multi-level facility location problems
- A two-level off-grid electric distribution problem on the continuous space
- Exact algorithms for budgeted prize-collecting covering subgraph problems
- Solving capacitated facility location problems by Fenchel cutting planes
- A cutting plane algorithm for the general routing problem
- The incremental connected facility location problem
- Solving Steiner trees: Recent advances, challenges, and perspectives
- A cut-and-solve based algorithm for the single-source capacitated facility location problem
- Configuration‐based approach for topological problems in the design of wireless sensor networks
- Towards optimizing the deployment of optical access networks
- The \(p\)-arborescence star problem: formulations and exact solution approaches
Uses Software
This page was built for publication: A cutting plane algorithm for the capacitated connected facility location problem
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2393652)
