The p/q-\texttt{ACTIVE} uncapacitated facility location problem: investigation of the solution space and an LP-fitting heuristic
From MaRDI portal
Publication:869586
Recommendations
- LP-based approximation for uniform capacitated facility location problem
- scientific article; zbMATH DE number 5501653
- A large-scale application of the partial coverage uncapacitated facility location problem
- Integer Programming and Combinatorial Optimization
- LP-based approximation algorithms for capacitated facility location
- An application of a Lagrangian-type relaxation for the uncapacitated facility location problem
- An LP-based heuristic for two-stage capacitated facility location problems
- An ex-post bound on the greedy heuristic for the uncapacitated facility location problem
- scientific article; zbMATH DE number 2209653
- A General k-Level Uncapacitated Facility Location Problem
Cites work
- scientific article; zbMATH DE number 44281 (Why is no real title available?)
- scientific article; zbMATH DE number 3470175 (Why is no real title available?)
- scientific article; zbMATH DE number 4123493 (Why is no real title available?)
- An efficient tabu search procedure for the \(p\)-median problem
- Heuristic Methods for Location-Allocation Problems
- Neighborhood search heuristics for the uncapacitated facility location problem
- Solving thep-Center problem with Tabu Search and Variable Neighborhood Search
- State of the Art—Location on Networks: A Survey. Part I: The p-Center and p-Median Problems
- The \(p/q\)-\texttt{ACTIVE} uncapacitated facility location problem: investigation of the solution space and an LP-fitting heuristic
- Variable neighborhood search for the p-median
This page was built for publication: The \(p/q\)-\texttt{ACTIVE} uncapacitated facility location problem: investigation of the solution space and an LP-fitting heuristic
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q869586)