Solving the anti-covering location problem using Lagrangian relaxation
From MaRDI portal
(Redirected from Publication:1373891)
Recommendations
Cites work
- scientific article; zbMATH DE number 46734 (Why is no real title available?)
- scientific article; zbMATH DE number 193411 (Why is no real title available?)
- scientific article; zbMATH DE number 3503127 (Why is no real title available?)
- scientific article; zbMATH DE number 3550467 (Why is no real title available?)
- scientific article; zbMATH DE number 3639144 (Why is no real title available?)
- scientific article; zbMATH DE number 1340526 (Why is no real title available?)
- scientific article; zbMATH DE number 4121754 (Why is no real title available?)
- A Strong Cutting Plane/Branch-and-Bound Algorithm for Node Packing
- A comparison of two dual-based procedures for solving the p-median problem
- An Analysis of Network Location Problems with Distance Constraints
- Analyzing tradeoffs between zonal constraints and accessibility in facility location
- Constructing And Selecting Adjacency Constraints
- Covers and packings in a family of sets
- Design and Implementation of an Interactive Optimization System for Telephone Network Planning
- Determining DNA sequence similarity using maximum independent set algorithms for interval graphs
- Exceptional Paper—Location of Bank Accounts to Optimize Float: An Analytic Study of Exact and Approximate Algorithms
- Extensions to a Lagrangean relaxation approach for the capacitated warehouse location problem
- Facets of the clique partitioning polytope
- Finding a Maximum Clique in an Arbitrary Graph
- Heuristic and Special Case Algorithms for Dispersion Problems
- Location of Two Facilities with Minimal Separation
- Maximal independent sets in bipartite graphs
- Minimax Location of Two Facilities with Minimum Separation: Interactive Graphical Solutions
- Minimum Weighted Coloring of Triangulated Graphs, with Application to Maximum Weight Vertex Packing and Clique Finding in Arbitrary Graphs
- On convergence rates of subgradient optimization methods
- On the facial structure of set packing polyhedra
- Set Partitioning: A survey
- Solving the maximum clique problem using a tabu search approach
- Technical Note—An Algorithm for the p-Median Problem
- The Lagrangian Relaxation Method for Solving Integer Programming Problems
- The Location of Emergency Service Facilities
- The Traveling-Salesman Problem and Minimum Spanning Trees
- The discrete p-dispersion problem
- The maximal dispersion problem and the ``first point outside the neighbourhood heuristic
- The maximum clique problem
- The maximum independent set problem for cubic planar graphs
- The traveling-salesman problem and minimum spanning trees: Part II
- The weighted maximum independent set problem in permutation graphs
- Validation of subgradient optimization
Cited in
(10)- scientific article; zbMATH DE number 5990408 (Why is no real title available?)
- The minimum weighted covering location problem with distance constraints
- Lagrangean relaxation with clusters for point-feature cartographic label placement problems
- Applying Lagrangian relaxation to the resolution of two-stage location problems
- Mixed-integer programming models for tower crane selection and positioning with respect to mutual interference
- A branch and bound approach for the tower crane selection and positioning problem with respect to mutual interference
- scientific article; zbMATH DE number 5990461 (Why is no real title available?)
- Dispersion with connectivity in wireless mesh networks
- Column generation approach for the point-feature cartographic label placement problem
- The disruptive anti-covering location problem
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)
