A general global optimization approach for solving location problems in the plane
From MaRDI portal
Publication:995943
DOI10.1007/s10898-006-9051-yzbMath1138.90010MaRDI QIDQ995943
Publication date: 10 September 2007
Published in: Journal of Global Optimization (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10898-006-9051-y
Related Items
Beam search heuristics for the single and multi-commodity capacitated multi-facility Weber problems, Locating a competitive facility in the plane with a robustness criterion, Revisiting several problems and algorithms in continuous location with \(\ell _\tau \) norms, Location and allocation based branch and bound algorithms for the capacitated multi-facility Weber problem, Sequential location of two facilities: comparing random to optimal location of the first facility, The wisdom of voters: evaluating the Weber objective in the plane at the Condorcet solution, Maximizing the minimum cover probability by emergency facilities, The theoretical and empirical rate of convergence for geometric branch-and-bound methods, The multicriteria big cube small cube method, On minimax-regret Huff location models, Solving scheduling and location problems in the plane simultaneously, The big cube small cube solution method for multidimensional facility location problems, Location of a facility minimizing nuisance to or from a planar network, Generalized coverage: new developments in covering location models, Optimizing the location of a production firm, Constructing a DC decomposition for ordered median problems, Continuous location problems and big triangle small triangle: Constructing better bounds, Solving the ordered one-median problem in the plane, A cross-monotonic cost-sharing scheme for the concave facility location game, Voronoi diagrams with overlapping regions, Fitting concentric circles to measurements, Location of a distribution center for a perishable product, A note on equity across groups in facility location, Big segment small segment global optimization algorithm on networks, A stochastic gradual cover location problem
Cites Work
- Unnamed Item
- Equity models in planar location
- Location with acceleration-deceleration distance
- GBSSS: The generalized big square small square method for planar single- facility location
- A probabilistic minimax location problem on the plane
- A d.c. optimization method for single facility location problems
- Finding the optimal solution to the Huff based competitive location model
- The gradual covering problem
- IMPROVEMENTS OF THE INCREMENTAL METHOD FOR THE VORONOI DIAGRAM WITH COMPUTATIONAL COMPARISON OF VARIOUS ALGORITHMS
- The Weber Problem On The Plane With Some Negative Weights
- Lost demand in a competitive environment
- The Big Triangle Small Triangle Method for the Solution of Nonconvex Facility Location Problems
- A ROBUST TOPOLOGY-ORIENTED INCREMENTAL ALGORITHM FOR VORONOI DIAGRAMS
- The central warehouse location problem revisited
- Locating a service facility with some unserviced demand
- Convex analysis and global optimization
