Covering part of a planar network

DOI10.1007/s11067-014-9263-5zbMath1338.90214OpenAlexW2060765480MaRDI QIDQ291695

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

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

Related Items (1)

Cooperative cover of uniform demand

Cites Work

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

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