Capacitated location-allocation problems on a line

DOI10.1016/S0305-0548(00)00084-8zbMath0994.90003OpenAlexW2095573082MaRDI QIDQ5959397

Gad Markovich, Moshe Eben-Chaime, Abraham Mehrez

Publication date: 30 July 2002

Published in: Computers \& Operations Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/s0305-0548(00)00084-8

Mathematics Subject Classification ID

Mixed integer programming (90C11) Approximation methods and heuristics in mathematical programming (90C59) Inventory, storage, reservoirs (90B05)

Related Items (4)

A global shooting algorithm for the facility location and capacity acquisition problem on a line with dense demand ⋮ A perturbation-based heuristic for the capacitated multisource Weber problem ⋮ Lower and upper bounds for a two-level hierarchical location problem in computer networks ⋮ Ant colony system solving capacitated location-allocation problems on a line

Cites Work

• Packing and covering a tree by subtrees
• Locational analysis
• Improved complexity bounds for location problems on the real line
• A distance constrained \(p\)-facility location problem on the real line
• An Overview of Representative Problems in Location Research
• Heuristics for the fixed cost median problem
• Note—One-Dimensional Facility Location-Allocation using Dynamic Programming
• Probabilistic Weights in the One-Dimensional Facility Location Problem
• Technical Note—A Polynomial Algorithm for the Equal Capacity p-Center Problem on Trees
• Capacitated Location Problems on a Line
• The Transportation-Location Problem
• A note on Fermat's problem
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Capacitated location-allocation problems on a line