Solving capacitated facility location problems by Fenchel cutting planes
From MaRDI portal
Publication:4680751
Recommendations
- A cutting plane algorithm for the capacitated facility location problem
- A cutting plane algorithm for the capacitated connected facility location problem
- Solving general continuous single facility location problems by cutting planes
- A cut-and-solve based algorithm for the single-source capacitated facility location problem
- An improved cut-and-solve algorithm for the single-source capacitated facility location problem
- On solving large instances of the capacitated facility location problem
- Practical techniques to solve capacitated facility location problem
- Fenchel Cutting Planes for Integer Programs
- scientific article; zbMATH DE number 1263271
- scientific article; zbMATH DE number 710403
Cited in
(10)- A cut and branch approach for the capacitated \(p\)-median problem based on Fenchel cutting planes
- Fenchel decomposition for stochastic mixed-integer programming
- Branch-and-cut and hybrid local search for the multi-level capacitated minimum spanning tree problem
- Integer set reduction for stochastic mixed-integer programming
- Solving general continuous single facility location problems by cutting planes
- Solving linear programming relaxations associated with Lagrangean relaxations by Fenchel cutting planes
- A cut-and-solve based algorithm for the single-source capacitated facility location problem
- A cutting-plane approach for large-scale capacitated multi-period facility location using a specialized interior-point method
- An effective hybrid approach to the two-stage capacitated facility location problem
- Stage- and scenario-wise Fenchel decomposition for stochastic mixed 0-1 programs with special structure
This page was built for publication: Solving capacitated facility location problems by Fenchel cutting planes
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4680751)
