A directional approach to gradual cover

DOI10.1007/s11750-018-00493-yzbMath1415.90049OpenAlexW2901070176MaRDI QIDQ2421326

Zvi Drezner, Tammy Drezner, Pawel Jan Kalczynski

Publication date: 17 June 2019

Published in: Top (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s11750-018-00493-y

zbMATH Keywords

partial covergradual covercover location models

Mathematics Subject Classification ID

Continuous location (90B85) Combinatorial optimization (90C27) Discrete location and assignment (90B80)

Related Items (3)

Directional approach to gradual cover: a maximin objective ⋮ Directional approach to gradual cover: the continuous case ⋮ Optimal number and length of point-like and line-like facilities of grid and random patterns

Uses Software

• Tabu search

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Optimization by Simulated Annealing
• A leader-follower model for discrete competitive facility location
• The maximin gradual cover location problem
• Continuous location model of a rectangular barrier facility
• On the structure of the solution set for the single facility location problem with average distances
• A method for numerical integration on an automatic computer
• Equity models in planar location
• A location-allocation heuristic for the capacitated multi-facility Weber problem with probabilistic customer locations
• Variable neighborhood search
• The gradual covering decay location problem on a network.
• Extensive facility location problems on networks: an updated review
• A multi-objective facility location problem in the presence of variable gradual coverage performance and cooperative cover
• A continuous covering location model with risk consideration
• Conditional median: a parametric solution concept for location problems
• A maximal covering location model in the presence of partial coverage
• On the conditional \(p\)-median problem
• Multi-objective competitive location problem with distance-based attractiveness and its best non-dominated solution
• Locating a minisum annulus: a new partial coverage distance model
• Dynamic multi-commodity capacitated facility location: a mathematical modeling framework for strategic supply chain planning
• Hybrid scatter search and path relinking for the capacitated \(p\)-median problem
• The gradual covering problem
• A multi-objective heuristic approach for the casualty collection points location problem
• Technical Note—Conditional Location Problems on Networks
• A stochastic gradual cover location problem
• Covering continuous demand in the plane
• The Big Triangle Small Triangle Method for the Solution of Nonconvex Facility Location Problems
• Location of regional facilities
• Location-Allocation Problems
• The p-center location problem in an area
• Replacing continuous demand with discrete demand in a competitive location model
• Heuristic Methods for Location-Allocation Problems
• The generalized Weber problem with expected distances
• The fortified Weiszfeld algorithm for solving the Weber problem
• Covering Problems
• Location of facilities with rectangular distances among point and area destinations
• A Simplex Method for Function Minimization
• An Approach to Location Models Involving Sets as Existing Facilities
• The generalized maximal covering location problem

This page was built for publication: A directional approach to gradual cover