A cutting plane algorithm for the capacitated connected facility location problem
From MaRDI portal
Publication:2393652
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
Cites work
- scientific article; zbMATH DE number 1947445 (Why is no real title available?)
- A Branch-and-Price algorithm for the Single Source Capacitated Plant Location Problem
- A Lagrangian Heuristic Based Branch-and-Bound Approach for the Capacitated Network Design Problem
- A Simplex-Based Tabu Search Method for Capacitated 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
- A local branching heuristic for the capacitated fixed-charge network design problem
- A slope scaling/Lagrangean perturbation heuristic with long-term memory for multicommodity capacitated fixed-charge network design
- Algorithms – ESA 2005
- An exact algorithm for the capacitated facility location problems with single sourcing
- Benders, metric and cutset inequalities for multicommodity capacitated network design
- Branch-and-cut-and-price for capacitated connected facility location
- Branch-and-price-and-cut for large-scale multicommodity capacitated fixed-charge network design
- Bundle-based relaxation methods for multicommodity capacitated fixed charge network design
- Capacitated Facility Location: Valid Inequalities and Facets
- Combining exact and heuristic approaches for the capacitated fixed-charge network flow problem
- Connected facility location via random facility sampling and core detouring
- Cycle-Based Neighbourhoods for Fixed-Charge Capacitated Multicommodity Network Design
- Dual-based local search for the connected facility location and related problems
- Exact approaches to the single-source network loading problem
- Hybrid metaheuristics. 4th international workshop, HM 2007, Dortmund, Germany, October 8--9, 2007. Proceedings
- MIP modeling of incremental connected facility location
- MIP models for connected facility location: a theoretical and computational study
- Path relinking, cycle-based neighbourhoods and capacitated multicommodity network design
- Scatter search for the single source capacitated facility location problem
- Separation algorithms for 0-1 knapsack polytopes
- Solving the capacitated local access network design problem
- The impact of filtering in a branch-and-cut algorithm for multicommodity capacitated fixed charge network design
Cited in
(16)- Capacitated facility location/network design problems.
- Multi-level facility location problems
- The connected facility location polytope
- A cutting plane algorithm for the capacitated facility location problem
- 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
- The incremental connected facility location problem
- A cutting plane algorithm for the general routing problem
- Solving Steiner trees: Recent advances, challenges, and perspectives
- A cut-and-solve based algorithm for the single-source capacitated facility location problem
- Branch-and-cut-and-price for capacitated connected facility location
- Towards optimizing the deployment of optical access networks
- Configuration‐based approach for topological problems in the design of wireless sensor networks
- The p-arborescence star problem: formulations and exact solution approaches
- MIP modeling of incremental connected facility location
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)
