Capacitated, balanced, sequential location-allocation problems on chains and trees

DOI10.1007/BF01588799zbMath0717.90039OpenAlexW1993154864MaRDI QIDQ2638927

Hanif D. Sherali

Publication date: 1991

Published in: Mathematical Programming. Series A. Series B (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/bf01588799

zbMATH Keywords

chain graphsnetwork locationtree networkssequential locationdynamic locationadditional capacitated facilityfinite horizon, multiperiod, sequential, minisum location- allocation problemsminisum locations

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Discrete location and assignment (90B80) Computational methods for problems pertaining to operations research and mathematical programming (90-08)

Related Items (2)

Discrete equal-capacityp-median problem ⋮ Stochastic location-assignment on an interval with sequential arrivals

Cites Work

• Unnamed Item
• The minisum location problem on an undirected network with continuous link demands
• Network location problems with continuous link demands: p-medians on a chain and 2-medians on a tree
• A Decomposition Algorithm for a Discrete Location-Allocation Problem
• Sequential location-allocation problems on chains and trees with probabilistic link demands
• A Capacitated, Balanced, 2-Median Problem on a Tree Network with a Continuum of Link Demands
• NP-Hard, Capacitated, Balanced p-Median Problems on a Chain Graph with a Continuum of Link Demands
• A finitely convergent algorithm for bilinear programming problems using polar cuts and disjunctive face cuts
• Optimal Locations on a Line Are Interleaved
• A cutting plane algorithm for solving bilinear programs
• The Centers and Medians of a Graph
• Optimum Locations of Switching Centers and the Absolute Centers and Medians of a Graph

This page was built for publication: Capacitated, balanced, sequential location-allocation problems on chains and trees