Solving the anti-covering location problem using Lagrangian relaxation

DOI10.1016/S0305-0548(96)00048-2zbMath0890.90124OpenAlexW2114538990MaRDI QIDQ1373891

Richard L. Church, Alan T. Murray

Publication date: 25 November 1997

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

Full work available at URL: https://doi.org/10.1016/s0305-0548(96)00048-2

zbMATH Keywords

Lagrangian relaxationLagrangian heuristicspatial optimizationanti-covering location

Mathematics Subject Classification ID

Discrete location and assignment (90B80)

Related Items (7)

The disruptive anti-covering location problem ⋮ The minimum weighted covering location problem with distance constraints ⋮ Column generation approach for the point-feature cartographic label placement problem ⋮ A branch and bound approach for the tower crane selection and positioning problem with respect to mutual interference ⋮ Dispersion with connectivity in wireless mesh networks ⋮ Lagrangean relaxation with clusters for point-feature cartographic label placement problems ⋮ Mixed-integer programming models for tower crane selection and positioning with respect to mutual interference

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Facets of the clique partitioning polytope
• The discrete p-dispersion problem
• A comparison of two dual-based procedures for solving the p-median problem
• Extensions to a Lagrangean relaxation approach for the capacitated warehouse location problem
• The weighted maximum independent set problem in permutation graphs
• Analyzing tradeoffs between zonal constraints and accessibility in facility location
• The maximum clique problem
• Solving the maximum clique problem using a tabu search approach
• The maximal dispersion problem and the ``first point outside the neighbourhood heuristic
• Maximal independent sets in bipartite graphs
• Minimum Weighted Coloring of Triangulated Graphs, with Application to Maximum Weight Vertex Packing and Clique Finding in Arbitrary Graphs
• An Analysis of Network Location Problems with Distance Constraints
• Covers and packings in a family of sets
• Finding a Maximum Clique in an Arbitrary Graph
• The maximum independent set problem for cubic planar graphs
• The Lagrangian Relaxation Method for Solving Integer Programming Problems
• Minimax Location of Two Facilities with Minimum Separation: Interactive Graphical Solutions
• Design and Implementation of an Interactive Optimization System for Telephone Network Planning
• A Strong Cutting Plane/Branch-and-Bound Algorithm for Node Packing
• Set Partitioning: A survey
• Exceptional Paper—Location of Bank Accounts to Optimize Float: An Analytic Study of Exact and Approximate Algorithms
• On convergence rates of subgradient optimization methods
• Technical Note—An Algorithm for the p-Median Problem
• Location of Two Facilities with Minimal Separation
• Heuristic and Special Case Algorithms for Dispersion Problems
• Validation of subgradient optimization
• Determining DNA sequence similarity using maximum independent set algorithms for interval graphs
• On the facial structure of set packing polyhedra
• The Location of Emergency Service Facilities
• The Traveling-Salesman Problem and Minimum Spanning Trees
• The traveling-salesman problem and minimum spanning trees: Part II
• Constructing And Selecting Adjacency Constraints

This page was built for publication: Solving the anti-covering location problem using Lagrangian relaxation