Note—On a Modified One-Center Model
From MaRDI portal
Publication:3912328
DOI10.1287/mnsc.27.7.848zbMath0462.90027OpenAlexW2101247530MaRDI QIDQ3912328
Publication date: 1981
Published in: Management Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1287/mnsc.27.7.848
computational complexitypolynomial algorithmcomputational experienceone-center modelsingle facility minimax location
Analysis of algorithms and problem complexity (68Q25) Integer programming (90C10) Inventory, storage, reservoirs (90B05)
Related Items
The p-cover problem, A single facility location problem with a weighted maximin-minimax rectilinear distance, Covering part of a planar network, Covering many or few points with unit disks, Territorial design optimization for business sales plan, On the conditional \(p\)-median problem, Linear Time Approximation Schemes for Geometric Maximum Coverage, The gradual covering decay location problem on a network., Covering point sets with two disjoint disks or squares, An iterated local search for the budget constrained generalized maximal covering location problem, Near-linear time approximation schemes for geometric maximum coverage, Competitive location in the plane, Static competitive facility location: an overview of optimisation approaches., The slab dividing approach to solve the Euclidean \(P\)-center problem, Generalized coverage: new developments in covering location models, On competitive sequential location in a network with a decreasing demand intensity, Covering problems with polyellipsoids: a location analysis perspective, New exact algorithms for planar maximum covering location by ellipses problems, Finding a cluster of points and the grey pattern quadratic assignment problem, The variable radius covering problem, Sequential location problems, ON PLANAR MEDIANOID COMPETITIVE LOCATION PROBLEMS WITH MANHATTAN DISTANCE, Polynomial algorithms for parametric minquantile and maxcovering planar location problems with locational constraints, The most points connected-covering problem with two disks, On a circle placement problem, The \(p\) maximal cover -- \(p\) partial center problem on networks
