A heuristic preprocessor supported algorithm for the capacitated plant location problem

DOI10.1016/0307-904X(91)90020-PzbMath0723.90045OpenAlexW2148547755MaRDI QIDQ2276874

Ömer Yaǧiz

Publication date: 1991

Published in: Applied Mathematical Modelling (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0307-904x(91)90020-p

zbMATH Keywords

exact algorithmcapacitated plant locationgeneralized search origin conceptheuristic preprocessor

Mathematics Subject Classification ID

Mixed integer programming (90C11) Discrete location and assignment (90B80) Boolean programming (90C09) Computational methods for problems pertaining to operations research and mathematical programming (90-08)

Related Items (1)

Optimal number and location of storage hubs and biogas production reactors in farmlands with allocation of multiple feedstocks

Cites Work

• Unnamed Item
• Extensions to a Lagrangean relaxation approach for the capacitated warehouse location problem
• A direct dual method for the mixed plant location problem with some side constraints
• A Cross Decomposition Algorithm for Capacitated Facility Location
• An efficient heuristic procedure for the capacitated warehouse location problem
• An Efficient Branch and Bound Algorithm for the Capacitated Warehouse Location Problem
• An Improved Algorithm for the Capacitated Facility Location Problem
• Algorithms for the Simple Plant-Location Problem with Some Side Conditions
• A branch‐bound algorithm for the capacitated facilities location problem
• An Additive Algorithm for Solving Linear Programs with Zero-One Variables

This page was built for publication: A heuristic preprocessor supported algorithm for the capacitated plant location problem