A general global optimization approach for solving location problems in the plane

DOI10.1007/S10898-006-9051-YMaRDI QIDQ995943zbMATH OpenOpenAlexFDO

Authors Zvi Drezner

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

zbMATH Keywords

single facilitybig triangle small triangle

Mathematics Subject Classification ID

Nonconvex programming, global optimization (90C26) Continuous location (90B85)

Recommendations

• Continuous location problems and big triangle small triangle: Constructing better bounds
• The Big Triangle Small Triangle Method for the Solution of Nonconvex Facility Location Problems
• A d.c. optimization method for single facility location problems
• A generalization of the rectangular bounding method for continuous location models
• The big cube small cube solution method for multidimensional facility location problems

Cites work

• scientific article; zbMATH DE number 679868 (Why is no real title available?)
• A ROBUST TOPOLOGY-ORIENTED INCREMENTAL ALGORITHM FOR VORONOI DIAGRAMS
• A d.c. optimization method for single facility location problems
• A probabilistic minimax location problem on the plane
• Convex analysis and global optimization
• Equity models in planar location
• Finding the optimal solution to the Huff based competitive location model
• GBSSS: The generalized big square small square method for planar single- facility location
• IMPROVEMENTS OF THE INCREMENTAL METHOD FOR THE VORONOI DIAGRAM WITH COMPUTATIONAL COMPARISON OF VARIOUS ALGORITHMS
• Locating a service facility with some unserviced demand
• Location with acceleration-deceleration distance
• Lost demand in a competitive environment
• The Big Triangle Small Triangle Method for the Solution of Nonconvex Facility Location Problems
• The Weber Problem On The Plane With Some Negative Weights
• The central warehouse location problem revisited
• The gradual covering problem

Cited in

(34)

• A refinement of the gravity model for competitive facility location
• Voronoi diagrams with overlapping regions
• The theoretical and empirical rate of convergence for geometric branch-and-bound methods
• Locating Objects in the Plane Using Global Optimization Techniques
• A cross-monotonic cost-sharing scheme for the concave facility location game
• The wisdom of voters: evaluating the Weber objective in the plane at the Condorcet solution
• Fitting concentric circles to measurements
• Gradual cover competitive facility location
• The big cube small cube solution method for multidimensional facility location problems
• Optimizing the location of a production firm
• Generalized coverage: new developments in covering location models
• A global optimization procedure for the location of a median line in the three-dimensional space
• Locating a competitive facility in the plane with a robustness criterion
• On minimax-regret Huff location models
• Competitive location models: a review
• Solving scheduling and location problems in the plane simultaneously
• The Big Triangle Small Triangle Method for the Solution of Nonconvex Facility Location Problems
• The multicriteria big cube small cube method
• The Weber Location Problem: The Threshold Objective
• Continuous location problems and big triangle small triangle: Constructing better bounds
• Solving the ordered one-median problem in the plane
• Location of a distribution center for a perishable product
• Big segment small segment global optimization algorithm on networks
• A note on equity across groups in facility location
• Location and allocation based branch and bound algorithms for the capacitated multi-facility Weber problem
• Location of a facility minimizing nuisance to or from a planar network
• Revisiting several problems and algorithms in continuous location with \(\ell _\tau \) norms
• Beam search heuristics for the single and multi-commodity capacitated multi-facility Weber problems
• Maximizing the minimum cover probability by emergency facilities
• Sequential location of two facilities: comparing random to optimal location of the first facility
• Competitive facility location under attrition
• A stochastic gradual cover location problem
• Constructing a DC decomposition for ordered median problems
• A new algorithm for solving planar multiobjective location problems involving the Manhattan norm

This page was built for publication: A general global optimization approach for solving location problems in the plane

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q995943)