A Decomposition Algorithm for a Discrete Location-Allocation Problem

DOI10.1287/OPRE.32.4.878MaRDI QIDQ3337913zbMATH OpenOpenAlexFDO

Authors Hanif D. Sherali, Warren P. Adams

Publication date 1984

Published in Operations Research (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1287/opre.32.4.878

zbMATH Keywords

Benders' decomposition methodcapacitated facilitiesComputational experienceconstruction and transportation costsdiscrete location-allocation problemimplicit enumerationnetwork-structured linear programspredesignated sites

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05) Inventory, storage, reservoirs (90B05) Large-scale problems in mathematical programming (90C06) Special problems of linear programming (transportation, multi-index, data envelopment analysis, etc.) (90C08) Boolean programming (90C09) Integer programming (90C10)

Recommendations

• scientific article; zbMATH DE number 975772
• scientific article; zbMATH DE number 949665
• Benders decomposition for large-scale uncapacitated hub location
• scientific article; zbMATH DE number 4204108
• A Cross Decomposition Algorithm for Capacitated Facility Location

Cited in

(19)

• Capital budgeting with Benders' decomposition
• A discretizing algorithm for location problems
• A localization and reformulation discrete programming approach for the rectilinear distance location-allocation problem
• Multicommodity flows and Benders decomposition for restricted continuous location problems
• Decomposition of the location problem
• Reduced first-level representations via the reformulation-linearization technique: Results, counterexamples, and computations
• An improved Benders decomposition algorithm for the logistics facility location problem with capacity expansions
• Capacitated, balanced, sequential location-allocation problems on chains and trees
• A note on node aggregation and Benders' decomposition
• scientific article; zbMATH DE number 4204108 (Why is no real title available?)
• scientific article; zbMATH DE number 4020811 (Why is no real title available?)
• scientific article; zbMATH DE number 1949048 (Why is no real title available?)
• scientific article; zbMATH DE number 949665 (Why is no real title available?)
• scientific article; zbMATH DE number 975772 (Why is no real title available?)
• RLT: A unified approach for discrete and continuous nonconvex optimization
• Decomposition strategies for large-scale continuous location–allocation problems
• Mixed-integer bilinear programming problems
• Discrete location problems with push-pull objectives
• Extending a continuous RLT-based algorithm to mixed-integer polynomial problems

This page was built for publication: A Decomposition Algorithm for a Discrete Location-Allocation Problem

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