Solving capacitated facility location problems by Fenchel cutting planes

DOI10.1057/PALGRAVE.JORS.2601810MaRDI QIDQ4680751zbMATH OpenOpenAlexFDO

Authors

Publication date 7 June 2005

Published in The Journal of the Operational Research Society (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1057/palgrave.jors.2601810

zbMATH Keywords

cutting planes heuristicsinteger programminglocation

Mathematics Subject Classification ID

Discrete location and assignment (90B80) Integer programming (90C10) Approximation methods and heuristics in mathematical programming (90C59)

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

(12)

• Solving general continuous single facility location problems by cutting planes
• An effective hybrid approach to the two-stage capacitated facility location problem
• A cut-and-solve based algorithm for the single-source capacitated facility location problem
• Fenchel decomposition for stochastic mixed-integer programming
• Solving linear programming relaxations associated with Lagrangean relaxations by Fenchel cutting planes
• A cut and branch approach for the capacitated \(p\)-median problem based on Fenchel cutting planes
• Integer set reduction for stochastic mixed-integer programming
• Branch-and-cut and hybrid local search for the multi-level capacitated minimum spanning tree problem
• Stage- and scenario-wise Fenchel decomposition for stochastic mixed 0-1 programs with special structure
• A cutting-plane approach for large-scale capacitated multi-period facility location using a specialized interior-point method
• Vehicle routing problem with time windows -- new valid inequalities from polar duality
• Modelling medical oxygen supply chain network under demand uncertainty using stochastic programming

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)