scientific article; zbMATH DE number 849074
From MaRDI portal
Publication:4867319
Recommendations
Cited in
(22)- Generalized p-center problems: Complexity results and approximation algorithms
- A new assignment rule to improve seed points algorithms for the continuous \(k\)-center problem
- Mixed-integer column generation algorithms and the probabilistic maximum satisfiability problem
- A p-center grid-positioning aggregation procedure
- Compact MILP formulations for the \(p\)-center problem
- Dominant, an algorithm for the \(p\)-center problem.
- The stratified p-center problem
- Exploiting flat subspaces in local search for \(p\)-center problem and two fault-tolerant variants
- A scaleable projection-based branch-and-cut algorithm for the \(p\)-center problem
- A new formulation and resolution method for the p-center problem
- The Mixed Center Location Problem
- Complexity of Determining the Most Vital Elements for the 1-median and 1-center Location Problems
- scientific article; zbMATH DE number 4209906 (Why is no real title available?)
- Centroidal Power Diagrams, Lloyd's Algorithm, and Applications to Optimal Location Problems
- The Solution of Distance Constrained Mini-Sum Location Problems
- On the Solution Value of the Continuous p-Center Location Problem on a Graph
- On alternativep-center problems
- Solving thep-Center problem with Tabu Search and Variable Neighborhood Search
- scientific article; zbMATH DE number 1417719 (Why is no real title available?)
- scientific article; zbMATH DE number 5205606 (Why is no real title available?)
- The \(p\)-hub center allocation problem
- A relaxation-based algorithm for solving the conditional \(p\)-center problem
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4867319)