Solving the anti-covering location problem using Lagrangian relaxation
From MaRDI portal
Publication:1373891
DOI10.1016/S0305-0548(96)00048-2zbMATH Open0890.90124OpenAlexW2114538990MaRDI QIDQ1373891FDOQ1373891
Authors: Alan T. Murray, Richard L. Church 
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
Recommendations
Cites Work
- The maximum clique problem
- On convergence rates of subgradient optimization methods
- Title not available (Why is that?)
- Title not available (Why is that?)
- The Lagrangian Relaxation Method for Solving Integer Programming Problems
- Title not available (Why is that?)
- Validation of subgradient optimization
- On the facial structure of set packing polyhedra
- The Location of Emergency Service Facilities
- The Traveling-Salesman Problem and Minimum Spanning Trees
- Title not available (Why is that?)
- The traveling-salesman problem and minimum spanning trees: Part II
- Finding a Maximum Clique in an Arbitrary Graph
- Set Partitioning: A survey
- Solving the maximum clique problem using a tabu search approach
- Facets of the clique partitioning polytope
- An Analysis of Network Location Problems with Distance Constraints
- Exceptional Paper—Location of Bank Accounts to Optimize Float: An Analytic Study of Exact and Approximate Algorithms
- Title not available (Why is that?)
- Title not available (Why is that?)
- Determining DNA sequence similarity using maximum independent set algorithms for interval graphs
- The discrete p-dispersion problem
- Heuristic and Special Case Algorithms for Dispersion Problems
- A comparison of two dual-based procedures for solving the p-median problem
- Technical Note—An Algorithm for the p-Median Problem
- A Strong Cutting Plane/Branch-and-Bound Algorithm for Node Packing
- Minimum Weighted Coloring of Triangulated Graphs, with Application to Maximum Weight Vertex Packing and Clique Finding in Arbitrary Graphs
- Design and Implementation of an Interactive Optimization System for Telephone Network Planning
- Maximal independent sets in bipartite graphs
- The weighted maximum independent set problem in permutation graphs
- The maximum independent set problem for cubic planar graphs
- Title not available (Why is that?)
- Extensions to a Lagrangean relaxation approach for the capacitated warehouse location problem
- The maximal dispersion problem and the ``first point outside the neighbourhood heuristic
- Covers and packings in a family of sets
- Constructing And Selecting Adjacency Constraints
- Minimax Location of Two Facilities with Minimum Separation: Interactive Graphical Solutions
- Analyzing tradeoffs between zonal constraints and accessibility in facility location
- Location of Two Facilities with Minimal Separation
Cited In (10)
- Mixed-integer programming models for tower crane selection and positioning with respect to mutual interference
- The disruptive anti-covering location problem
- Title not available (Why is that?)
- Title not available (Why is that?)
- The minimum weighted covering location problem with distance constraints
- Applying Lagrangian relaxation to the resolution of two-stage location problems
- A branch and bound approach for the tower crane selection and positioning problem with respect to mutual interference
- Column generation approach for the point-feature cartographic label placement problem
- Lagrangean relaxation with clusters for point-feature cartographic label placement problems
- Dispersion with connectivity in wireless mesh networks
This page was built for publication: Solving the anti-covering location problem using Lagrangian relaxation
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1373891)
