Covering part of a planar network

DOI10.1007/S11067-014-9263-5MaRDI QIDQ291695zbMATHOpenAlexFDO

Authors George O. Wesolowsky, Zvi Drezner

Publication date 10 June 2016

Published in Networks and Spatial Economics (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/s11067-014-9263-5

zbMATH Keywords

networksmaximal coveringminimal coveringobnoxious facilities

Mathematics Subject Classification ID

Deterministic network models in operations research (90B10) Small world graphs, complex networks (graph-theoretic aspects) (05C82) Packing and covering in (n) dimensions (aspects of discrete geometry) (52C17) Discrete location and assignment (90B80) Continuous location (90B85)

Recommendations

• The \(p\) maximal cover -- \(p\) partial center problem on networks
• A maximum trip covering location problem with an alternative mode of transportation on tree networks and segments
• The maximin gradual cover location problem
• The variable radius covering problem
• Cooperative covering problems on networks

Cites work

• scientific article; zbMATH DE number 417962 (Why is no real title available?)
• scientific article; zbMATH DE number 1803755 (Why is no real title available?)
• scientific article; zbMATH DE number 1803756 (Why is no real title available?)
• scientific article; zbMATH DE number 9246 (Why is no real title available?)
• scientific article; zbMATH DE number 961966 (Why is no real title available?)
• A ROBUST TOPOLOGY-ORIENTED INCREMENTAL ALGORITHM FOR VORONOI DIAGRAMS
• A maximal covering location model in the presence of partial coverage
• A new heuristic for solving the \(p\)-median problem in the plane
• A scenario-based model for fleet allocation of freeway service patrols
• A stochastic gradual cover location problem
• A stochastic optimization model to reduce expected post-disaster response time through pre-disaster investment decisions
• Big segment small segment global optimization algorithm on networks
• Determining optimal police patrol areas with maximal covering and backup covering location models
• Dual toll pricing for hazardous materials transport with linear delay
• GBSSS: The generalized big square small square method for planar single- facility location
• Generalized coverage: new developments in covering location models
• Heuristic procedures for the m-partial cover problem on a plane
• IMPROVEMENTS OF THE INCREMENTAL METHOD FOR THE VORONOI DIAGRAM WITH COMPUTATIONAL COMPARISON OF VARIOUS ALGORITHMS
• Location Theory, Dominance, and Convexity
• Location of a facility minimizing nuisance to or from a planar network
• Mixed route strategies for the risk-averse shipment of hazardous materials
• New approaches to circle packing in a square. With program codes.
• Note—On a Modified One-Center Model
• Optimal fleet allocation of freeway service patrols
• Optimal location of routes for vehicles transporting hazardous materials
• Robust facility location problem for hazardous waste transportation
• Single Facility $l_p $-Distance Minimax Location
• Solving the multiple competitive facilities location problem
• The Big Triangle Small Triangle Method for the Solution of Nonconvex Facility Location Problems
• The Maximum Coverage Location Problem
• The big cube small cube solution method for multidimensional facility location problems
• The generalized maximal covering location problem
• The gradual covering decay location problem on a network.
• The gradual covering problem
• The median tour and maximal covering tour problems: Formulations and heuristics
• The minimum equitable radius location problem with continuous demand
• The minimum weighted covering location problem with distance constraints
• The p-center location problem in an area
• The p-cover problem
• Two algorithms for constructing a Delaunay triangulation

Cited in

(21)

• Near-optimal disjoint-path facility location through set cover by pairs
• An heuristic algorithm for handling multiple responses
• A defensive maximal covering problem on a network
• On covering location problems on networks with edge demand
• A computational approach for eliminating error in the solution of the location set covering problem
• Cooperative cover of uniform demand
• A minimum length covering subgraph of a network
• Continuous maximal covering location problems with interconnected facilities
• On the overlap area of a disk and a piecewise circular domain
• The \(p\) maximal cover -- \(p\) partial center problem on networks
• Covering edges in networks
• Transmitter location for maximum coverage and constructive-destructive interference management
• Planar maximum coverage location problem with partial coverage and rectangular demand and service zones
• The variable radius covering problem
• Covering continuous demand in the plane
• A mean-shift algorithm for large-scale planar maximal covering location problems
• Cooperative covering problems on networks
• Determining placement of systems demarcated by hemispheres
• A general approach for the location of transfer points on a network with a trip covering criterion and mixed distances
• A maximum trip covering location problem with an alternative mode of transportation on tree networks and segments
• The \(K\)-coverage concentrator location problem

This page was built for publication: Covering part of a planar network

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q291695)