Solving capacitated facility location problems by Fenchel cutting planes
From MaRDI portal
Publication:4680751
DOI10.1057/palgrave.jors.2601810zbMath1113.90087MaRDI 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
90C10: Integer programming
90C59: Approximation methods and heuristics in mathematical programming
90B80: Discrete location and assignment
Related Items
Stage- and scenario-wise Fenchel decomposition for stochastic mixed 0-1 programs with special structure, 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, Integer set reduction for stochastic mixed-integer programming, Branch-and-cut and hybrid local search for the multi-level capacitated minimum spanning tree problem