Solving the anti-covering location problem using Lagrangian relaxation
type: Item
instance of: scholarly article
title: Solving the anti-covering location problem using Lagrangian relaxation
zbMATH Open document ID: 0890.90124
DOI: 10.1016/S0305-0548(96)00048-2
author: Alan T. Murray
author: Richard L. Church
published in: Computers \& Operations Research
publication date: 1997-11-25T00:00:00Z
Mathematics Subject Classification ID: 90B80
zbMATH DE Number: 1091596
zbMATH Keywords: anti-covering location
zbMATH Keywords: spatial optimization
zbMATH Keywords: Lagrangian relaxation
zbMATH Keywords: Lagrangian heuristic
MaRDI profile type: Publication
cites work: Q4198056
cites work: Extensions to a Lagrangean relaxation approach for the capacitated warehouse location problem
cites work: An Analysis of Network Location Problems with Distance Constraints
cites work: Q4265884
cites work: Q4040221
cites work: The maximum clique problem
cites work: Covers and packings in a family of sets
cites work: Minimum Weighted Coloring of Triangulated Graphs, with Application to Maximum Weight Vertex Packing and Clique Finding in Arbitrary Graphs
cites work: Finding a Maximum Clique in an Arbitrary Graph
cites work: Q4083324
cites work: Determining DNA sequence similarity using maximum independent set algorithms for interval graphs
cites work: Design and Implementation of an Interactive Optimization System for Telephone Network Planning
cites work: The discrete p-dispersion problem
cites work: Minimax Location of Two Facilities with Minimum Separation: Interactive Graphical Solutions
cites work: The maximal dispersion problem and the ``first point outside the neighbourhood'' heuristic
cites work: Location of Two Facilities with Minimal Separation
cites work: Heuristic and Special Case Algorithms for Dispersion Problems
cites work: The maximum independent set problem for cubic planar graphs
cites work: The weighted maximum independent set problem in permutation graphs
cites work: Maximal independent sets in bipartite graphs
cites work: A Strong Cutting Plane/Branch-and-Bound Algorithm for Node Packing
cites work: Solving the maximum clique problem using a tabu search approach
cites work: The Traveling-Salesman Problem and Minimum Spanning Trees
cites work: The traveling-salesman problem and minimum spanning trees: Part II
cites work: The Lagrangian Relaxation Method for Solving Integer Programming Problems
cites work: Exceptional Paper—Location of Bank Accounts to Optimize Float: An Analytic Study of Exact and Approximate Algorithms
cites work: Technical Note—An Algorithm for the p-Median Problem
cites work: A comparison of two dual-based procedures for solving the p-median problem
cites work: Q3996913
cites work: Q4124606
cites work: Constructing And Selecting Adjacency Constraints
cites work: Validation of subgradient optimization
cites work: Q4735035
cites work: Analyzing tradeoffs between zonal constraints and accessibility in facility location
cites work: On convergence rates of subgradient optimization methods
cites work: On the facial structure of set packing polyhedra
cites work: Set Partitioning: A survey
cites work: Facets of the clique partitioning polytope
cites work: The Location of Emergency Service Facilities
full work available at URL: s0305-0548(96)00048-2
OpenAlex ID: W2114538990
description: scientific article; zbMATH DE number 1091596