The following pages link to (Q3147657):
Displaying 38 items.
- Optimizing some constructions with bars: new geometric knapsack problems (Q266044) (← links)
- Covering part of a planar network (Q291695) (← links)
- A primal algorithm for the weighted minimum covering ball problem in \(\mathbb {R}^n\) (Q301399) (← links)
- An adaptive perturbation-based heuristic: an application to the continuous \(p\)-centre problem (Q342496) (← links)
- Sequential competitive location on networks (Q439407) (← links)
- A maximum trip covering location problem with an alternative mode of transportation on tree networks and segments (Q458952) (← links)
- On a robustness property in single-facility location in continuous space (Q458962) (← links)
- The maximin gradual cover location problem (Q480773) (← links)
- An iterated local search for the budget constrained generalized maximal covering location problem (Q483216) (← links)
- An agent-based framework for modeling and solving location problems (Q610998) (← links)
- Planar expropriation problem with non-rigid rectangular facilities (Q709112) (← links)
- A dual algorithm for the minimum covering ball problem in \(\mathbb R^n\) (Q833570) (← links)
- The maximin line problem with regional demand (Q872234) (← links)
- Generalized coverage: new developments in covering location models (Q976025) (← links)
- The pos/neg-weighted median problem on block graphs with subgraph-shaped customers (Q985733) (← links)
- Center location problems on tree graphs with subtree-shaped customers (Q1005232) (← links)
- The variable radius covering problem (Q1027534) (← links)
- Location and layout planning. A survey (Q1372765) (← links)
- The gradual covering decay location problem on a network. (Q1410306) (← links)
- A multi-objective facility location problem in the presence of variable gradual coverage performance and cooperative cover (Q1683144) (← links)
- Benders decomposition for very large scale partial set covering and maximal covering location problems (Q1719620) (← links)
- Optimization of competitive facility location for chain stores (Q1730656) (← links)
- Speeding up the optimal method of Drezner for the \(p\)-centre problem in the plane (Q1752856) (← links)
- On \(k\) nearest points of a finite set in a normed linear space (Q1887036) (← links)
- A dual algorithm for the minimum covering weighted ball problem in \({\mathbb{R}^n}\) (Q1941021) (← links)
- Cooperative cover of uniform demand (Q2005869) (← links)
- Covering problems with polyellipsoids: a location analysis perspective (Q2028797) (← links)
- A dual simplex-type algorithm for the smallest enclosing ball of balls (Q2044498) (← links)
- A branch-and-bound method for the minimum \(k\)-enclosing ball problem (Q2157894) (← links)
- Unmanned aerial vehicle set covering problem considering fixed-radius coverage constraint (Q2177831) (← links)
- The pos/neg-weighted 1-median problem on tree graphs with subtree-shaped customers (Q2268861) (← links)
- Locating a minisum annulus: a new partial coverage distance model (Q2408523) (← links)
- Locating a semi-obnoxious covering facility with repelling polygonal regions (Q2444554) (← links)
- Alternative fuel station location model with demand learning (Q2516748) (← links)
- The continuous \(p\)-centre problem: an investigation into variable neighbourhood search with memory (Q2629705) (← links)
- Minmax regret maximal covering location problems with edge demands (Q2668649) (← links)
- Upgrading edges in the maximal covering location problem (Q2673553) (← links)
- The minimum covering Euclidean ball of a set of Euclidean balls in \(\mathbb{R}^n\) (Q6103201) (← links)
