The gradual covering decay location problem on a network.

From MaRDI portal
Publication:1410306

DOI10.1016/S0377-2217(02)00604-5zbMath1053.90076MaRDI QIDQ1410306

Dmitry Krass, Zvi Drezner, Oded Berman

Publication date: 14 October 2003

Published in: European Journal of Operational Research (Search for Journal in Brave)




Related Items (48)

A multi-objective genetic algorithm for a bi-objective facility location problem with partial coverageCovering part of a planar networkA new formulation and Benders decomposition for the multi-period maximal covering facility location problem with server uncertaintyA bibliography for some fundamental problem categories in discrete location scienceDesigning emergency response networks for hazardous materials transportationA bilevel exposure-oriented sensor location problem for border securityContinuous space maximal coverage: insights, advances and challengesA review of congestion models in the location of facilities with immobile serversReview of obnoxious facilities location problemsUsing the generalized maximum covering location model to control a project's progressDirectional approach to gradual cover: a maximin objectiveA multi-objective facility location problem in the presence of variable gradual coverage performance and cooperative coverOptimization models for cloud seeding network design and operationsThe generalized discrete ‐centroid problemA directional approach to gradual coverThe minmax regret gradual covering location problem on a network with incomplete information of demand weightsLocation Science in CanadaA data-driven optimization framework for routing mobile medical facilitiesGradual cover competitive facility locationNovel formulations and VNS-based heuristics for single and multiple allocation \(p\)-hub maximal covering problemsA model for locating preventive health care facilitiesA maximum trip covering location problem with an alternative mode of transportation on tree networks and segmentsBenders decomposition for very large scale partial set covering and maximal covering location problemsLocation coverage models with demand originating from nodes and paths: Application to cellular network designOn the overlap area of a disk and a piecewise circular domainThe maximin gradual cover location problemAn iterated local search for the budget constrained generalized maximal covering location problemModeling and solution of maximal covering problem considering gradual coverage with variable radius over multi-periodsA stochastic gradual cover location problemThe minimal covering location and sizing problem in the presence of gradual cooperative coverageIncorporating the threat of terrorist attacks in the design of public service facility networksAn exact solution framework for the multiple gradual cover location problemThe ordered gradual covering location problem on a networkCooperative cover of uniform demandGeneralized coverage: new developments in covering location modelsThe probabilistic gradual covering location problem on a network with discrete random demand weightsA defensive maximal covering problem on a networkOrientational variable-length strip covering problem: a branch-and-price-based algorithmDirectional approach to gradual cover: the continuous caseOn the fuzzy maximal covering location problemMulti-objective competitive location problem with distance-based attractiveness and its best non-dominated solutionAlternative fuel station location model with demand learningFuzzy logic based algorithms for maximum covering location problemsThe variable radius covering problemA new model for maximal coverage exploiting GIS capabilitiesIncorporating congestion in preventive healthcare facility network designA location-or-routing problem with partial and decaying coverageAn improved IP formulation for the uncapacitated facility location problem: capitalizing on objective function structure



Cites Work


This page was built for publication: The gradual covering decay location problem on a network.