Solving capacitated facility location problems by Fenchel cutting planes

DOI10.1057/palgrave.jors.2601810zbMath1113.90087OpenAlexW1973658994MaRDI QIDQ4680751

No author found.

Publication date: 7 June 2005

Published in: 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

integer programminglocationcutting planes heuristics

Mathematics Subject Classification ID

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

Related Items (6)

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 cut-and-solve based algorithm for the single-source capacitated facility location problem ⋮ Fenchel decomposition for stochastic mixed-integer programming ⋮ Integer set reduction for stochastic mixed-integer programming ⋮ An effective hybrid approach to the two-stage capacitated facility location problem

This page was built for publication: Solving capacitated facility location problems by Fenchel cutting planes