scientific article
From MaRDI portal
Publication:3147657
zbMath1013.90089MaRDI QIDQ3147657
Publication date: 27 June 2003
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Related Items (38)
Optimizing some constructions with bars: new geometric knapsack problems ⋮ A dual algorithm for the minimum covering ball problem in \(\mathbb R^n\) ⋮ Covering part of a planar network ⋮ On \(k\) nearest points of a finite set in a normed linear space ⋮ A primal algorithm for the weighted minimum covering ball problem in \(\mathbb {R}^n\) ⋮ The continuous \(p\)-centre problem: an investigation into variable neighbourhood search with memory ⋮ A branch-and-bound method for the minimum \(k\)-enclosing ball problem ⋮ An adaptive perturbation-based heuristic: an application to the continuous \(p\)-centre problem ⋮ Location and layout planning. A survey ⋮ The maximin line problem with regional demand ⋮ Locating a minisum annulus: a new partial coverage distance model ⋮ Unmanned aerial vehicle set covering problem considering fixed-radius coverage constraint ⋮ Minmax regret maximal covering location problems with edge demands ⋮ An agent-based framework for modeling and solving location problems ⋮ A multi-objective facility location problem in the presence of variable gradual coverage performance and cooperative cover ⋮ Upgrading edges in the maximal covering location problem ⋮ The minimum covering Euclidean ball of a set of Euclidean balls in \(\mathbb{R}^n\) ⋮ A dual algorithm for the minimum covering weighted ball problem in \({\mathbb{R}^n}\) ⋮ The gradual covering decay location problem on a network. ⋮ Sequential competitive location on networks ⋮ 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 ⋮ On a robustness property in single-facility location in continuous space ⋮ Benders decomposition for very large scale partial set covering and maximal covering location problems ⋮ Optimization of competitive facility location for chain stores ⋮ The maximin gradual cover location problem ⋮ An iterated local search for the budget constrained generalized maximal covering location problem ⋮ Speeding up the optimal method of Drezner for the \(p\)-centre problem in the plane ⋮ Cooperative cover of uniform demand ⋮ Generalized coverage: new developments in covering location models ⋮ Planar expropriation problem with non-rigid rectangular facilities ⋮ The pos/neg-weighted 1-median problem on tree graphs with subtree-shaped customers ⋮ The pos/neg-weighted median problem on block graphs with subgraph-shaped customers ⋮ Covering problems with polyellipsoids: a location analysis perspective ⋮ Alternative fuel station location model with demand learning ⋮ Center location problems on tree graphs with subtree-shaped customers ⋮ A dual simplex-type algorithm for the smallest enclosing ball of balls ⋮ The variable radius covering problem
This page was built for publication:
