Optimal and heuristic algorithms for multiproduct uncapacitated facility location

DOI10.1016/0377-2217(86)90186-4zbMath0593.90028OpenAlexW2084904911MaRDI QIDQ1076603

Hanan Luss, Eric Rosenberg, John G. Klincewicz

Publication date: 1986

Published in: European Journal of Operational Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0377-2217(86)90186-4

zbMATH Keywords

branch-and-boundmultiple productssubproblemsLower boundsuncapacitated facility locationComputational resulsdual ascent routine

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05) Integer programming (90C10) Inventory, storage, reservoirs (90B05)

Related Items

A cross decomposition algorithm for a multiproduct-multitype facility location problem, On the exact solution of large-scale simple plant location problems, A \(k\)-product uncapacitated facility location problem, Facility location models for distribution system design, A branch-and-bound method for multicommodity location with balancing requirements, Heuristic methods and applications: A categorized survey

Cites Work

• The simple plant location problem: Survey and synthesis
• A Dual-Based Procedure for Uncapacitated Facility Location
• An Efficient Branch and Bound Algorithm for the Capacitated Warehouse Location Problem
• An Efficient Branch and Bound Algorithm for the Warehouse Location Problem
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item