GBSSS: The generalized big square small square method for planar single- facility location
From MaRDI portal
Publication:1196029
DOI10.1016/0377-2217(92)90244-4zbMath0760.90067OpenAlexW2022071508MaRDI QIDQ1196029
Publication date: 4 January 1993
Published in: European Journal of Operational Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/0377-2217(92)90244-4
Continuous location (90B85) Computational methods for problems pertaining to operations research and mathematical programming (90-08)
Related Items (71)
Estimating the circle closest to a set of points by maximum likelihood using the BHHH algorithm ⋮ A note on equity across groups in facility location ⋮ Covering part of a planar network ⋮ The quintile share ratio in location analysis ⋮ A unified model for Weber problems with continuous and network distances ⋮ An efficient solution method for Weber problems with barriers based on genetic algorithms ⋮ Solving the semi-desirable facility location problem using bi-objective particle swarm ⋮ Beam search heuristics for the single and multi-commodity capacitated multi-facility Weber problems ⋮ New heuristic algorithms for solving the planar \(p\)-median problem ⋮ The Weber obnoxious facility location model: a big arc small arc approach ⋮ Voronoi diagrams with overlapping regions ⋮ Solving a huff-like competitive location and design model for profit maximization in the plane ⋮ Continuous location of an assembly station ⋮ Competitive facility location model with concave demand ⋮ Locating a minisum annulus: a new partial coverage distance model ⋮ A BSSS algorithm for the location problem with minimum square error ⋮ Planar location and design of a new facility with inner and outer competition: an interval lexicographical-like solution procedure ⋮ The theoretical and empirical rate of convergence for geometric branch-and-bound methods ⋮ The multicriteria big cube small cube method ⋮ Dominating sets for convex functions with some applications ⋮ Robust fitting of circle arcs ⋮ Incorporating neighborhood reduction for the solution of the planar \(p\)-median problem ⋮ Solving a minisum single facility location problem in three regions with different norms ⋮ A global optimization procedure for the location of a median line in the three-dimensional space ⋮ Approximating generalized distance functions on weighted triangulated surfaces with applications ⋮ Geometric branch-and-bound methods for constrained global optimization problems ⋮ A branch-and-bound approach for estimating covering functionals of convex bodies ⋮ Competitive facility location and design with reactions of competitors already in the market ⋮ Unnamed Item ⋮ Fitting concentric circles to measurements ⋮ Algebraic properties of location problems with one circular barrier. ⋮ Locating a semi-obnoxious covering facility with repelling polygonal regions ⋮ A maximum trip covering location problem with an alternative mode of transportation on tree networks and segments ⋮ Geometric fit of a point set by generalized circles ⋮ A continuous location model for siting a non-noxious undesirable facility within a geographical region ⋮ Obtaining an outer approximation of the efficient set of nonlinear biobjective problems ⋮ Location and allocation based branch and bound algorithms for the capacitated multi-facility Weber problem ⋮ Single-facility huff location problems on networks ⋮ Location of a facility minimizing nuisance to or from a planar network ⋮ Sequential location of two facilities: comparing random to optimal location of the first facility ⋮ New local searches for solving the multi-source Weber problem ⋮ Up- and downgrading the Euclidean 1-median problem and knapsack Voronoi diagrams ⋮ An interactive solution approach for a bi-objective semi-desirable location problem ⋮ Static competitive facility location: an overview of optimisation approaches. ⋮ A solution algorithm for non-convex mixed integer optimization problems with only few continuous variables ⋮ Theoretical rate of convergence for interval inclusion functions ⋮ A BSSS algorithm for the single facility location problem in two regions with different norms ⋮ Discretization and resolution of the \((r| X_ p)\)-medianoid problem involving quality criteria. ⋮ On the circle closest to a set of points ⋮ A general global optimization approach for solving location problems in the plane ⋮ On the convergence of the Weiszfeld algorithm for continuous single facility location-allocation problems ⋮ The big cube small cube solution method for multidimensional facility location problems ⋮ Undesirable facility location with minimal covering objectives ⋮ A robust and efficient algorithm for planar competitive location problems ⋮ Location of retail facilities under conditions of uncertainty ⋮ Asymmetric distances, semidirected networks and majority in Fermat-Weber problems ⋮ Aggregation error for location models: Survey and analysis ⋮ Efficient solution approaches for a discrete multi-facility competitive interaction model ⋮ Location with acceleration-deceleration distance ⋮ On a branch-and-bound approach for a Huff-like Stackelberg location problem ⋮ On the impact of spatial pattern, aggregation, and model parameters in planar Huff-type competitive location and design problems ⋮ Weber problems with alternative transportation systems ⋮ Continuous location problems and big triangle small triangle: Constructing better bounds ⋮ Big segment small segment global optimization algorithm on networks ⋮ Semi-obnoxious location models: A global optimization approach ⋮ Some personal views on the current state and the future of locational analysis ⋮ A multiobjective programming model for locating treatment sites and routing hazardous wastes ⋮ A convex Hull algorithm for solving a location problem ⋮ The Location of Undesirable Facilities ⋮ The Weiszfeld Algorithm: Proof, Amendments, and Extensions ⋮ The bicriterion semi-obnoxious location (BSL) problem solved by an \(\varepsilon\)-approximation
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- A destination optimality in asymmetric distance Fermat-Weber problems
- Localization in single facility location
- The general optimal market area model
- Geometrical properties of the Fermat-Weber problem
- A general class of branch-and-bound methods in global optimization with some new approaches for concave minimization
- Solving general continuous single facility location problems by cutting planes
- The minimization of lower subdifferentiable functions under nonlinear constraints: An all feasible cutting plane algorithm
- Convergence and restart in branch-and-bound algorithms for global optimization. Application to concave minimization and d.c. optimization problems
- The minimax center estimation problem for automated roundness inspection
- A branch-and-bound algorithm for the location of facilities causing atmospheric pollution
- The Minisum and Minimax Location Problems Revisited
- The P-Centroid Problem on an Inclined Plane
- The Asymmetric Distance Location Problem
- The Transportation-Location Problem
This page was built for publication: GBSSS: The generalized big square small square method for planar single- facility location
