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

DOI10.1007/S10898-006-9051-YzbMATH Open1138.90010OpenAlexW2052763633MaRDI QIDQ995943FDOQ995943

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

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

zbMATH Keywords

single facilitybig triangle small triangle

Mathematics Subject Classification ID

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

Cites Work

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

Cited In (34)

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

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)