A Maxmin Location Problem
From MaRDI portal
Publication:3893624
DOI10.1287/opre.28.6.1385zbMath0447.90024OpenAlexW2100697955MaRDI QIDQ3893624
No author found.
Publication date: 1980
Published in: Operations Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1287/opre.28.6.1385
convex polyhedroncombinatorial algorithmEuclidean distancemaxmin locationnonconvex programming algorithms
Related Items
A heuristic approach to the single facility maximin location problem, Determining an optimum location for an undesirable facility in a workroom environment, A single facility location problem with a weighted maximin-minimax rectilinear distance, Effective methods for solving the bi-criteria \(p\)-center and \(p\)-dispersion problem, An integer programming approach for solving the \(p\)-dispersion problem, Hazardous waste management problem: the case for incineration, On the Ball-Constrained Weighted Maximin Dispersion Problem, \(p\)-median and \(p\)-dispersion problems: a bi-criteria analysis, A note on center problems with forbidden polyhedra, Approximating the weighted maximin dispersion problem over an \(\ell _p\)-ball: SDP relaxation is misleading, Covering a simplex by spheres: complexity and algorithms, Analytical models for locating undesirable facilities, Approximation accuracy, gradient methods, and error bound for structured convex optimization, An \(O(mn^ 2)\) algorithm for the maximin problem in \(E^ 2\), Review of obnoxious facilities location problems, Solving DC programs with a polyhedral component utilizing a multiple objective linear programming solver, Optimal location of routes for vehicles transporting hazardous materials, Semi-obnoxious single facility location in Euclidean space., The problem of locating facilities causing airborne pollution revisited, A branch-and-bound algorithm for the location of facilities causing atmospheric pollution, Location of a semi-obnoxious facility with elliptic maximin and network minisum objectives, The complexity of a special convex programming problem connected with nonlinear optimization, On the ordered anti-Weber problem for any norm in \(\mathbb R^2\), Locating a semi-obnoxious facility in the special case of Manhattan distances, Planar expropriation problem with non-rigid rectangular facilities, An efficient low complexity algorithm for box-constrained weighted maximin dispersion problem, New approximation algorithms for weighted maximin dispersion problem with box or ball constraints, Locational optimization problems solved through Voronoi diagrams, The discrete p-maxian location problem, Maximin location: Discretization not always works, The obnoxious \(p\) facility network location problem with facility interaction, Some personal views on the current state and the future of locational analysis, Location of an undesirable facility in a polygonal region with forbidden zones, The Location of Undesirable Facilities, Obnoxious-facility location and data-envelopment analysis: a combined distance-based formula\-tion, Solution of a non-linear programming problem with quadratic functions, Locating an undesirable facility with a minimax criterion
