The Minisum and Minimax Location Problems Revisited
From MaRDI portal
Publication:3705190
DOI10.1287/opre.33.6.1251zbMath0582.90027OpenAlexW2124990434MaRDI QIDQ3705190
Jacques-François Thisse, Pierre Hansen, Dominique Peeters, Denis Richard
Publication date: 1985
Published in: Operations Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1287/opre.33.6.1251
facility locationcomputational resultssolution methodssum of the weighted distancesminisum and minimax problemsnonlinear functions of distancesrestricted location area
Numerical mathematical programming methods (65K05) Inventory, storage, reservoirs (90B05) Mathematical programming (90C99)
Related Items
A generalized Weber problem with different gauges for different regions ⋮ Solving general continuous single facility location problems by cutting planes ⋮ Constrained location of competitive facilities in the plane ⋮ An efficient solution method for Weber problems with barriers based on genetic algorithms ⋮ Noncooperative facility location games ⋮ Beam search heuristics for the single and multi-commodity capacitated multi-facility Weber problems ⋮ Solving a huff-like competitive location and design model for profit maximization in the plane ⋮ A maximum \(L_p\) distance problem ⋮ A BSSS algorithm for the location problem with minimum square error ⋮ The theoretical and empirical rate of convergence for geometric branch-and-bound methods ⋮ A discretizing algorithm for location problems ⋮ The multicriteria big cube small cube method ⋮ Dominating sets for convex functions with some applications ⋮ Robust fitting of circle arcs ⋮ Solving a minisum single facility location problem in three regions with different norms ⋮ An active set strategy to address the ill-conditioning of smoothing methods for solving finite linear minimax problems ⋮ 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 ⋮ Geometric branch-and-bound methods for constrained global optimization problems ⋮ Unnamed Item ⋮ Algebraic properties of location problems with one circular barrier. ⋮ A maximum trip covering location problem with an alternative mode of transportation on tree networks and segments ⋮ A continuous location model for siting a non-noxious undesirable facility within a geographical region ⋮ The problem of locating facilities causing airborne pollution revisited ⋮ Single-facility huff location problems on networks ⋮ GBSSS: The generalized big square small square method for planar single- facility location ⋮ A branch-and-bound algorithm for the location of facilities causing atmospheric pollution ⋮ Theoretical rate of convergence for interval inclusion functions ⋮ A BSSS algorithm for the single facility location problem in two regions with different norms ⋮ On the ordered anti-Weber problem for any norm in \(\mathbb R^2\) ⋮ On minimax-regret Huff location models ⋮ A truncated aggregate smoothing Newton method for minimax problems ⋮ On the circle closest to a set of points ⋮ 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 ⋮ Convergence criteria for generalized gradient methods of solving locally Lipschitz feasibility problems ⋮ Rank-two update algorithm versus Frank-Wolfe algorithm with away steps for the weighted Euclidean one-center problem ⋮ The continuous center set of a network ⋮ A robust and efficient algorithm for planar competitive location problems ⋮ Location of retail facilities under conditions of uncertainty ⋮ 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 ⋮ Semi-obnoxious location models: A global optimization approach ⋮ Some personal views on the current state and the future of locational analysis ⋮ A convex Hull algorithm for solving a location problem ⋮ Stabilized column generation ⋮ An aggregate homotopy method for solving unconstrained minimax problems ⋮ On heuristic bi-criterion methods for semi-obnoxious facility location ⋮ The bicriterion semi-obnoxious location (BSL) problem solved by an \(\varepsilon\)-approximation
