Location of a facility minimizing nuisance to or from a planar network
Computers and Operations Research
The big cube small cube solution method for multidimensional facility location problems
Computers and Operations Research
Solving scheduling and location problems in the plane simultaneously
Computers and Operations Research
Constructing a DC decomposition for ordered median problems
Journal of Global Optimization
Continuous location problems and Big Triangle Small Triangle: constructing better bounds
Journal of Global Optimization
Locating Objects in the Plane Using Global Optimization Techniques
Mathematics of Operations Research
Review: Generalized coverage: New developments in covering location models
Computers and Operations Research
On minimax-regret Huff location models
Computers and Operations Research
The theoretical and empirical rate of convergence for geometric branch-and-bound methods
Journal of Global Optimization
Survey: Covering problems in facility location: A review
Computers and Industrial Engineering
Minimizing ordered weighted averaging of rational functions with applications to continuous location
Computers and Operations Research
A cross-monotonic cost-sharing scheme for the concave facility location game
Journal of Global Optimization
Voronoi diagrams with overlapping regions
OR Spectrum
Beam search heuristics for the single and multi-commodity capacitated Multi-facility Weber Problems
Computers and Operations Research
Hi-index | 0.00 |
We propose a general approach for constructing bounds required for the "Big Triangle Small Triangle" (BTST) method for the solution of planar location problems. Optimization problems, which constitute a sum of individual functions, each a function of the Euclidean distance to a demand point, are analyzed and solved. These bounds are based on expressing each of the individual functions in the sum as a difference between two convex functions of the distance, which is not the same as convex functions of the location. Computational experiments with nine different location problems demonstrated the effectiveness of the proposed procedure.