scientific article; zbMATH DE number 1803755
From MaRDI portal
Publication:3147657
Recommendations
Cited in
(46)- Locating a semi-obnoxious covering facility with repelling polygonal regions
- Optimizing some constructions with bars: new geometric knapsack problems
- An agent-based framework for modeling and solving location problems
- Ultrametric location and parsimonious representation
- Unmanned aerial vehicle variable radius set covering problem for emergency wireless network
- Cooperative cover of uniform demand
- The continuous \(p\)-centre problem: an investigation into variable neighbourhood search with memory
- Planar expropriation problem with non-rigid rectangular facilities
- On \(k\) nearest points of a finite set in a normed linear space
- Covering part of a planar network
- Covering continuous demand in the plane
- Center location problems on tree graphs with subtree-shaped customers
- Minmax regret maximal covering location problems with edge demands
- Speeding up the optimal method of Drezner for the \(p\)-centre problem in the plane
- Upgrading edges in the maximal covering location problem
- Generalized coverage: new developments in covering location models
- A primal algorithm for the weighted minimum covering ball problem in \(\mathbb {R}^n\)
- Sequential competitive location on networks
- Covering problems with polyellipsoids: a location analysis perspective
- Alternative fuel station location model with demand learning
- The gradual covering decay location problem on a network.
- The maximin line problem with regional demand
- Optimization of competitive facility location for chain stores
- 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
- A dual algorithm for the minimum covering ball problem in \(\mathbb R^n\)
- A faster dual algorithm for the Euclidean minimum covering ball problem
- A continuous covering location model with risk consideration
- Continuous space maximal coverage: insights, advances and challenges
- A dual simplex-type algorithm for the smallest enclosing ball of balls
- A branch-and-bound method for the minimum \(k\)-enclosing ball problem
- Location and layout planning. A survey
- The pos/neg-weighted median problem on block graphs with subgraph-shaped customers
- The minimum covering Euclidean ball of a set of Euclidean balls in \(\mathbb{R}^n\)
- An adaptive perturbation-based heuristic: an application to the continuous p-centre problem
- Continuous location problems and big triangle small triangle: Constructing better bounds
- An iterated local search for the budget constrained generalized maximal covering location problem
- An extended continuous maximal covering location problem with facility placement
- The maximin gradual cover location problem
- A multi-objective facility location problem in the presence of variable gradual coverage performance and cooperative cover
- Unmanned aerial vehicle set covering problem considering fixed-radius coverage constraint
- A dual algorithm for the minimum covering weighted ball problem in \({\mathbb{R}^n}\)
- The variable radius covering problem
- Locating a minisum annulus: a new partial coverage distance model
- The pos/neg-weighted 1-median problem on tree graphs with subtree-shaped customers
- Benders decomposition for very large scale partial set covering and maximal covering location problems
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3147657)
