The gradual covering problem
From MaRDI portal
Publication:3156756
DOI10.1002/nav.20030zbMath1075.90047MaRDI QIDQ3156756
Zvi Drezner, George O. Wesolowsky, Tammy Drezner
Publication date: 11 January 2005
Published in: Naval Research Logistics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1002/nav.20030
Related Items
Covering part of a planar network, Beam search heuristics for the single and multi-commodity capacitated multi-facility Weber problems, The maximin gradual cover location problem, An iterated local search for the budget constrained generalized maximal covering location problem, Location and allocation based branch and bound algorithms for the capacitated multi-facility Weber problem, Generalized coverage: new developments in covering location models, A general global optimization approach for solving location problems in the plane, The variable radius covering problem, Continuous location problems and big triangle small triangle: Constructing better bounds, The gradual covering decay location problem on a network., A bilevel exposure-oriented sensor location problem for border security, A multi-objective facility location problem in the presence of variable gradual coverage performance and cooperative cover, On the overlap area of a disk and a piecewise circular domain, On the Weber facility location problem with limited distances and side constraints, Alternative fuel station location model with demand learning, A stochastic gradual cover location problem, A defensive maximal covering problem on a network
Cites Work
