Single Facility $l_p $-Distance Minimax Location

From MaRDI portal
Publication:3967330

DOI10.1137/0601036zbMath0501.90031OpenAlexW2061925106MaRDI QIDQ3967330

George O. Wesolowsky, Zvi Drezner

Publication date: 1980

Published in: SIAM Journal on Algebraic Discrete Methods (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1137/0601036




Related Items

A single facility location problem with a weighted maximin-minimax rectilinear distanceA note on equity across groups in facility locationLayout of facilities with some fixed pointsCovering part of a planar networkHazardous waste management problem: the case for incinerationAnalytical models for locating undesirable facilitiesOptimal location of routes for vehicles transporting hazardous materialsOn the complexity of the exchange algorithm for minimax optimization problemsAn optimal approximation algorithm for the rectilinear m-center problemAn O\((n \log{}n)\) algorithm for a maxmin location problemThe wisdom of voters: evaluating the Weber objective in the plane at the Condorcet solutionA recursive algorithm for finding the minimum covering sphere of a polytope and the minimum covering concentric spheres of several polytopesRectilinear m -Center problemA truncated aggregate smoothing Newton method for minimax problemsSolving scheduling and location problems in the plane simultaneouslyRank-two update algorithm versus Frank-Wolfe algorithm with away steps for the weighted Euclidean one-center problemOn weighted rectilinear 2-center and 3-center problemsSpecial issue on Locational analysisLocation of rectilinear center trajectoriesThe obnoxious \(p\) facility network location problem with facility interactionRestricted center problems under polyhedral gaugesLocation of an undesirable facility in a polygonal region with forbidden zonesContinuous Center ProblemsThe multi-facility min-max Weber problem



Cites Work