A localization and reformulation discrete programming approach for the rectilinear distance location-allocation problem

DOI10.1016/0166-218X(94)90218-6zbMath0799.90071OpenAlexW1978509623MaRDI QIDQ1327241

Sridhar Ramachandran, Hanif D. Sherali, Seong-In Kim

Publication date: 17 November 1994

Published in: Discrete Applied Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0166-218x(94)90218-6

zbMATH Keywords

bilinear programmingLagrangian dual formulationlinear mixed-integer problemlocation of capacitated facilitiesrectilinear distance location-allocation problem

Mathematics Subject Classification ID

Mixed integer programming (90C11) Discrete location and assignment (90B80)

Related Items

Beam search heuristics for the single and multi-commodity capacitated multi-facility Weber problems, A guided reactive GRASP for the capacitated multi-source Weber problem, The continuous single source location problem with capacity and zone-dependent fixed cost: models and solution approaches, Location and allocation based branch and bound algorithms for the capacitated multi-facility Weber problem, A catalog of Hanan grid problems, Efficient approximate solution methods for the multi-commodity capacitated multi-facility Weber problem, Single-source capacitated multi-facility Weber problem-an iterative two phase heuristic algorithm, The location-allocation problem of drone base stations, Region-rejection based heuristics for the capacitated multi-source Weber problem, Discrete approximation heuristics for the capacitated continuous location-allocation problem with probabilistic customer locations

Cites Work

• Unnamed Item
• Unnamed Item
• Mixed-integer bilinear programming problems
• Facility location models for distribution planning
• A primal-dual conjugate subgradient algorithm for specially structured linear and convex programming problems
• A new reformulation-linearization technique for bilinear programming problems
• A hierarchy of relaxations and convex hull characterizations for mixed- integer zero-one programming problems
• A Decomposition Algorithm for a Discrete Location-Allocation Problem
• NP-Hard, Capacitated, Balanced p-Median Problems on a Chain Graph with a Continuum of Link Demands
• Location-Allocation Problems
• An efficient algorithm for the location-allocation problem with rectangular regions
• Properties and Solution Methods for Large Location-Allocation Problems
• A squared-euclidean distance location-allocation problem
• A computation procedure for the exact solution of location-allocation problems with rectangular distances
• The bilinear programming problem
• Heuristic Methods for Location-Allocation Problems
• Integer Programming by Implicit Enumeration and Balas’ Method
• The Transportation-Location Problem
• Exact and approximate solutions to the multisource weber problem
• Location Theory, Dominance, and Convexity