NP-Hard, Capacitated, Balanced p-Median Problems on a Chain Graph with a Continuum of Link Demands

DOI10.1287/moor.13.1.32zbMath0651.90025OpenAlexW2062171861MaRDI QIDQ3796941

Frederick L. Nordai, Hanif D. Sherali

Publication date: 1988

Published in: Mathematics of Operations Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1287/moor.13.1.32

zbMATH Keywords

NP-hardlocationallocationchain graphgreedy strategycontinuum of link demandscapacitated, balanced p-median problems

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Applications of mathematical programming (90C90) Inventory, storage, reservoirs (90B05)

Related Items (25)

A localization and reformulation discrete programming approach for the rectilinear distance location-allocation problem ⋮ Capacitated, balanced, sequential location-allocation problems on chains and trees ⋮ Beam search heuristics for the single and multi-commodity capacitated multi-facility Weber problems ⋮ Global optimization algorithm for capacitated multi-facility continuous location-allocation problems ⋮ Integer linear programming models for grid-based light post location problem ⋮ The optimal solution set of the multi-source Weber problem ⋮ Location-allocation analysis of humanitarian distribution plans: a case of united nations humanitarian response depots ⋮ The continuous single source location problem with capacity and zone-dependent fixed cost: models and solution approaches ⋮ A continuation approach for the capacitated multi-facility weber problem based on nonlinear SOCP reformulation ⋮ Semi-discrete optimal transport: a solution procedure for the unsquared Euclidean distance case ⋮ On the convergence of the Cooper's algorithm ⋮ Location and allocation based branch and bound algorithms for the capacitated multi-facility Weber problem ⋮ 2-facility manifold location routing problem ⋮ Efficient approximate solution methods for the multi-commodity capacitated multi-facility Weber problem ⋮ A hierarchical algorithm for the planar single-facility location routing problem ⋮ Single-source capacitated multi-facility Weber problem-an iterative two phase heuristic algorithm ⋮ The capacitated multi-facility location–allocation problem with probabilistic customer location and demand: two hybrid meta-heuristic algorithms ⋮ The location-allocation problem of drone base stations ⋮ The continuous single-source capacitated multi-facility Weber problem with setup costs: formulation and solution methods ⋮ Multi-objective multi-layer congested facility location-allocation problem optimization with Pareto-based meta-heuristics ⋮ Discrete approximation heuristics for the capacitated continuous location-allocation problem with probabilistic customer locations ⋮ A location-allocation heuristic for the capacitated multi-facility Weber problem with probabilistic customer locations ⋮ The incorporation of fixed cost and multilevel capacities into the discrete and continuous single source capacitated facility location problem ⋮ A branch-and-price approach for the continuous multifacility monotone ordered median problem ⋮ A heuristic algorithm to solve the single-facility location routing problem on Riemannian surfaces

This page was built for publication: NP-Hard, Capacitated, Balanced p-Median Problems on a Chain Graph with a Continuum of Link Demands