Covering Problems

DOI10.1007/978-1-4419-7572-0_6zbMath1387.90117OpenAlexW4243636471MaRDI QIDQ5506721

Lawrence V. Snyder

Publication date: 16 December 2016

Published in: International Series in Operations Research & Management Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-1-4419-7572-0_6

Mathematics Subject Classification ID

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

Related Items (11)

Directional approach to gradual cover: a maximin objective ⋮ A directional approach to gradual cover ⋮ Efficient heuristics for a partial set covering problem with mutually exclusive pairs of facilities ⋮ Cellular automata rules solving the wireless sensor network coverage problem ⋮ Gradual cover competitive facility location ⋮ Efficient presolving methods for solving maximal covering and partial set covering location problems ⋮ Benders decomposition for very large scale partial set covering and maximal covering location problems ⋮ On the overlap area of a disk and a piecewise circular domain ⋮ Cooperative cover of uniform demand ⋮ Directional approach to gradual cover: the continuous case ⋮ A Benders decomposition algorithm for the maximum availability service facility location problem

Cites Work

• Developing effective meta-heuristics for a probabilistic location model via experimental design
• Aggregation effects in maximum covering models
• Facility siting and integer-friendly programming
• A Lagrangean heuristic for the maximal covering location problem
• The queueing maximal availability location problem: A model for the siting of emergency vehicles
• Inventory, transportation, service quality and the location of distribution centers
• Solving large-scale maximum expected covering location problems by genetic algorithms: a comparative study
• Towards unified formulations and extensions of two classical probabilistic location models
• The Maximal Expected Covering Location Problem: Revisited
• The Maximum Coverage Location Problem
• The Lagrangian Relaxation Method for Solving Integer Programming Problems
• Technical Note—Counterexamples for the Location of Emergency Service Facilities
• Technical Note—Reply to Rao's Note on the Location of Emergency Service Facilities
• Approximating the Performance of Urban Emergency Service Systems
• On the Effectiveness of Set Covering Formulations for the Vehicle Routing Problem with Time Windows
• The Maximum Availability Location Problem
• Optimum Distribution of Switching Centers in a Communication Network and Some Related Graph Theoretic Problems
• An Analysis of Private and Public Sector Location Models
• The Location of Emergency Service Facilities
• Optimum Locations of Switching Centers and the Absolute Centers and Medians of a Graph

This page was built for publication: Covering Problems