Capacitated location-allocation problems on a line

DOI10.1016/S0305-0548(00)00084-8MaRDI QIDQ5959397zbMATH OpenOpenAlexFDO

Authors Moshe Eben-Chaime, Abraham Mehrez, Gad Markovich

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

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

Recommendations

• Location and sizing of facilities on a line
• Capacitated Location Problems on a Line
• The Capacitated p-facility Location Problem on the Real Line
• Capacitated, balanced, sequential location-allocation problems on chains and trees
• Hierarchical location-allocation models for congested systems

Cites work

• scientific article; zbMATH DE number 44281 (Why is no real title available?)
• scientific article; zbMATH DE number 3639144 (Why is no real title available?)
• scientific article; zbMATH DE number 4123493 (Why is no real title available?)
• scientific article; zbMATH DE number 3027356 (Why is no real title available?)
• A distance constrained p-facility location problem on the real line
• A note on Fermat's problem
• An Overview of Representative Problems in Location Research
• Capacitated Location Problems on a Line
• Heuristics for the fixed cost median problem
• Improved complexity bounds for location problems on the real line
• Locational analysis
• Note—One-Dimensional Facility Location-Allocation using Dynamic Programming
• Packing and covering a tree by subtrees
• Probabilistic Weights in the One-Dimensional Facility Location Problem
• Technical Note—A Polynomial Algorithm for the Equal Capacity p-Center Problem on Trees
• The Transportation-Location Problem

Cited in

(8)

• Construction Line Algorithms for the Connection Location-Allocation Problem
• Lower and upper bounds for a two-level hierarchical location problem in computer networks
• The Capacitated p-facility Location Problem on the Real Line
• Line Segment Facility Location in Weighted Subdivisions
• 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
• Location and sizing of facilities on a line
• Ant colony system solving capacitated location-allocation problems on a line

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

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