The p-Median and Its Linear Programming Relaxation: An Approach to Large Problems
From MaRDI portal
Cited in
(21)- A comparison of two dual-based procedures for solving the p-median problem
- An optimal method for solving the (generalized) multi-Weber problem
- 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
- Formulating logical implications in combinatorial optimisation
- A Lagrangian search method for the \(P\)-median problem
- The simple plant location problem: Survey and synthesis
- The complete vertex \(p\)-center problem
- An adaptive multiphase approach for large unconditional and conditional \(p\)-median problems
- BEAMR: an exact and approximate model for the p-median problem
- A fast swap-based local search procedure for location problems
- Solving the \(p\)-median problem on regular and lattice networks
- A decomposition approach for facility location and relocation problem with uncertain number of future facilities
- Discrete facility location in machine learning
- Geographical information systems and location science
- A generalized model for locating facilities on a network with flow-based demand
- Fifty years of location theory -- a selective review
- Revisiting a Cornuéjols-Nemhauser-Wolsey formulation for the \(\mathrm{p}\)-median problem
This page was built for publication: The p-Median and Its Linear Programming Relaxation: An Approach to Large Problems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3856423)
