Solving a class of two-dimensional uncapacitated location-allocation problems by dynamic programming

DOI10.1287/OPRE.46.5.702MaRDI QIDQ2770100zbMATH OpenOpenAlexFDO

Authors Jack Brimberg, Robert F. Love

Publication date 7 February 2002

Published in Operations Research (Search for Journal in Brave)

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

zbMATH Keywords

one-dimensional dynamic programmingtwo-dimensional location-allocation problems

Mathematics Subject Classification ID

Dynamic programming (90C39) Discrete location and assignment (90B80)

Recommendations

• On the Two-Level Uncapacitated Facility Location Problem
• A method for solving to optimality uncapacitated location problems
• An approximation algorithm for the maximization version of the two level uncapacitated facility location problem
• Lagrangean relaxation and decomposition in an uncapacitated 2-hierarchal location-allocation problem
• A dual-based optimization procedure for the two-echelon uncapacitated facility location problem
• scientific article; zbMATH DE number 5501653
• scientific article; zbMATH DE number 1285999
• Allocation search methods for a generalized class of location-allocation problems
• Lower bounds for the two-stage uncapacitated facility location problem
• Solving the uncapacitated multiple allocation hub location problem by means of a dual-ascent technique

Cited in

(4)

• Location and sizing of facilities on a line
• A global shooting algorithm for the facility location and capacity acquisition problem on a line with dense demand
• A two-echelon joint continuous-discrete location model
• Solving multiple facilities location problems with separated clusters

This page was built for publication: Solving a class of two-dimensional uncapacitated location-allocation problems by dynamic programming

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