The p-Median and Its Linear Programming Relaxation: An Approach to Large Problems
From MaRDI portal
Publication:3856423
DOI10.2307/3009503zbMath0422.90049OpenAlexW4254390287MaRDI QIDQ3856423
Kenneth E. Rosing, H. Rosing-Vogelaar, Charles S. Re Velle
Publication date: 1979
Published in: The Journal of the Operational Research Society (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.2307/3009503
linear programming relaxationcomputational experiencep-medianp-median problemplant locationlarge problems
Related Items (19)
BEAMR: an exact and approximate model for the \(p\)-median problem ⋮ Solving the \(p\)-median problem on regular and lattice networks ⋮ A Lagrangian search method for the \(P\)-median problem ⋮ A generalized model for locating facilities on a network with flow-based demand ⋮ Discrete facility location in machine learning ⋮ A decomposition approach for facility location and relocation problem with uncertain number of future facilities ⋮ The complete vertex \(p\)-center problem ⋮ An optimal method for solving the (generalized) multi-Weber problem ⋮ A fast swap-based local search procedure for location problems ⋮ An adaptive multiphase approach for large unconditional and conditional \(p\)-median problems ⋮ Geographical information systems and location science ⋮ Facility siting and integer-friendly programming ⋮ Applying the flow-capturing location-allocation model to an authentic network: Edmonton, Canada ⋮ Heuristic concentration: Two stage solution construction ⋮ Facets for node packing ⋮ Heuristic concentration and tabu search: A head to head comparison ⋮ The simple plant location problem: Survey and synthesis ⋮ A comparison of two dual-based procedures for solving the p-median problem ⋮ Formulating logical implications in combinatorial optimisation
This page was built for publication: The p-Median and Its Linear Programming Relaxation: An Approach to Large Problems
