scientific article; zbMATH DE number 5872754

MaRDI QIDQ3085407zbMATH OpenFDO

Authors Eiman Jadaan Alenezy, Aishah al-Dubaibi, Khalid Moh. Alhamad

Publication date 31 March 2011

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

zbMATH Keywords

FLPgreedy heuristicsCFLPcut off pointUCFLP

Mathematics Subject Classification ID

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

Recommendations

• Observations on some heuristic methods for the capacitated facility location problem
• An effective heuristic for large-scale capacitated facility location problems
• Greedy algorithms for the single-demand facility location problem
• An ex-post bound on the greedy heuristic for the uncapacitated facility location problem
• Neighborhood search heuristics for the uncapacitated facility location problem
• A heuristic lagrangean algorithm for the capacitated plant location problem
• On solving large instances of the capacitated facility location problem
• scientific article; zbMATH DE number 1342123
• Improved approximation algorithms for capacitated facility location problems

Cited in

(6)

• A heuristic approach to the single facility maximin location problem
• Heuristic Solutions to the Facility Location Problem with General Bernoulli Demands
• A model and solutions based on the greedy ant colony algorithm for the capacitated facility location problem
• An effective heuristic for large-scale capacitated facility location problems
• Practical techniques to solve capacitated facility location problem
• scientific article; zbMATH DE number 1866926 (Why is no real title available?)

This page was built for publication:

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