The minimum weighted covering location problem with distance constraints

DOI10.1016/j.cor.2006.03.003zbMath1141.90022OpenAlexW2126718551MaRDI 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 constraintMinimum coverageanti-covering

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Discrete location and assignment (90B80)

Related Items

Minimal covering unrestricted location of obnoxious facilities: bi-objective formulation and a case study, Covering part of a planar network, Equality measures properties for location problems, Structural Properties of Voronoi Diagrams in Facility Location Problems with Continuous Demand, The disruptive anti-covering location problem, The Weber obnoxious facility location model: a big arc small arc approach, On covering location problems on networks with edge demand, An agent-based framework for modeling and solving location problems, Solving nonconvex nonlinear programs with reverse convex constraints by sequential linear programming, 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, Balancing the arrival times of users in a two-stage location problem, Location problems with continuous demand and unreliable facilities: applications of families of incremental Voronoi diagrams, Public facility location using dispersion, population, and equity criteria, Fuzzy logic based algorithms for maximum covering location problems, Big segment small segment global optimization algorithm on networks, The Location of Undesirable Facilities

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