Practical techniques to solve capacitated facility location problem

MaRDI QIDQ3407416zbMATH OpenFDO

Authors Eiman Jadaan Alenezy

Publication date 4 March 2010

Full work available at URL http://pphmj.com/abstract/4589.htm

zbMATH Keywords

CFLPcut off pointFLPgreedy heuristics

Mathematics Subject Classification ID

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

Recommendations

• scientific article; zbMATH DE number 5872754
• An effective heuristic for large-scale capacitated facility location problems
• A simple but usually fast branch-and-bound algorithm for the capacitated facility location problem
• Near-optimal solutions to large-scale facility location problems
• A branch-and-price algorithm for the capacitated facility location problem

Cited in

(1)

• Solving capacitated facility location problems by Fenchel cutting planes

This page was built for publication: Practical techniques to solve capacitated facility location problem

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3407416)