The minimum weighted covering location problem with distance constraints

DOI10.1016/j.cor.2006.03.003zbMath1141.90022MaRDI QIDQ2384883

Oded Berman, Rong-Bing Huang

Publication date: 10 October 2007

Published in: Computers \& Operations Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.cor.2006.03.003

zbMATH Keywords

distance constraint; Minimum coverage; anti-covering

Mathematics Subject Classification ID

90C35: Programming involving graphs or networks

90B80: Discrete location and assignment

Related Items

The Location of Undesirable Facilities, Covering part of a planar network, The disruptive anti-covering location problem, On covering location problems on networks with edge demand, Balancing the arrival times of users in a two-stage location problem, An agent-based framework for modeling and solving location problems, Minimal covering unrestricted location of obnoxious facilities: bi-objective formulation and a case study, Fuzzy logic based algorithms for maximum covering location problems, The Weber obnoxious facility location model: a big arc small arc approach, Location problems with continuous demand and unreliable facilities: applications of families of incremental Voronoi diagrams, Conditional facility location problems with continuous demand and a polygonal barrier, The minimal covering location and sizing problem in the presence of gradual cooperative coverage, Public facility location using dispersion, population, and equity criteria, Equality measures properties for location problems, Big segment small segment global optimization algorithm on networks, Structural Properties of Voronoi Diagrams in Facility Location Problems with Continuous Demand

Uses Software

• SITATION
• MOD-DIST
• MENU-OKF
• Tabu search

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• A simple tabu search for warehouse location
• Analytical models for locating undesirable facilities
• An efficient tabu search procedure for the \(p\)-median problem
• A tabu search approach to the uncapacitated facility location problem
• Solving the anti-covering location problem using Lagrangian relaxation
• A note on the location of an obnoxious facility on a network
• An Analysis of Network Location Problems with Distance Constraints
• The Maximal Covering Location Problem with Capacities on Total Workload
• The Lagrangian Relaxation Method for Solving Integer Programming Problems
• Obnoxious Facility Location on Graphs
• A Strong Cutting Plane/Branch-and-Bound Algorithm for Node Packing
• Exceptional Paper—Location of Bank Accounts to Optimize Float: An Analytic Study of Exact and Approximate Algorithms
• Technical Note—An Algorithm for the p-Median Problem
• The expropriation location problem
• The Location of Emergency Service Facilities