A projection method for \(l_ p\) norm location-allocation problems
From MaRDI portal
Publication:1337136
DOI10.1007/BF01581151zbMath0829.90085OpenAlexW1981280806MaRDI QIDQ1337136
Ingrid Bongartz, Andrew R. Conn, Paul H. Calamai
Publication date: 30 October 1994
Published in: Mathematical Programming. Series A. Series B (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/bf01581151
Related Items
On the choice of aggregation points for continuous \(p\)-median problems: A case for the gravity centre, A distance-limited continuous location-allocation problem for spatial planning of decentralized systems, New heuristic algorithms for solving the planar \(p\)-median problem, A new heuristic for solving the \(p\)-median problem in the plane, Duality theorem for a generalized Fermat-Weber problem, Biologically inspired parent selection in genetic algorithms, Clustering and the perturbed spatial median, Solving the planar \(p\)-Median problem by variable neighborhood and concentric searches, A two-echelon joint continuous-discrete location model, A voltage drop limited decentralized electric power distribution network, Incorporating neighborhood reduction for the solution of the planar \(p\)-median problem, Mean-variance value at risk criterion for solving a \(p\)-median location problem on networks with type-2 intuitionistic fuzzy weights, Location Science in Canada, A planar facility location-allocation problem with fixed and/or variable cost structures for rural electrification, Accelerating the convergence in the single-source and multi-source Weber problems, A cellular heuristic for the multisource Weber problem., Self-organizing feature maps for solving location--allocation problems with rectilinear distances., Classical and inverse median location problems under uncertain environment, New local searches for solving the multi-source Weber problem, A fuzzy algorithm for continuous capacitated location allocation model with risk consideration, A new local search for continuous location problems, A hyperbolic smoothing approach to the multisource Weber problem, Allocation search methods for a generalized class of location-allocation problems, A hybrid data mining metaheuristic for the p‐median problem, Heuristic solution of the multisource Weber problem as a \(p\)-median problem, Norm statistics and the complexity of clustering problems, Using injection points in reformulation local search for solving continuous location problems, Generating good starting solutions for the p-median problem in the plane, Multi-facility green Weber problem, Heuristic solutions to multi-depot location-routing problems, An efficient hybrid particle swarm optimization algorithm for solving the uncapacitated continuous location-allocation problem
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- A projection method for the uncapacitated facility location problem
- An optimal method for solving the (generalized) multi-Weber problem
- Heuristics Based on Spacefilling Curves for Combinatorial Problems in Euclidean Space
- A projected newton method forl p norm location problems
- Location-Allocation Problems
- Properties and Solution Methods for Large Location-Allocation Problems
- An Efficient Method for the Multi-Depot Location-Allocation Problem
- A New Algorithm for Locating Sources Among Destinations
- Large-scale linearly constrained optimization
- Heuristic Methods for Location-Allocation Problems
- Exact and approximate solutions to the multisource weber problem
- A note on Fermat's problem
