A constructive heuristic for the uniform capacitated vertex k-center problem

Cites Work

TSPLIB—A Traveling Salesman Problem Library
Clustering to minimize the maximum intercluster distance
A Best Possible Heuristic for the k-Center Problem
How to Allocate Network Centers
The Capacitated K-Center Problem
A simple heuristic for the p-centre problem
A heuristic for the p-center problem in graphs
An exact algorithm for the capacitated vertex \(p\)-center problem
Centrality of trees for capacitated \(k\)-center
Lagrangean duals and exact solution to the capacitated \(p\)-center problem
A new formulation and resolution method for the \(p\)-center problem
Double bound method for solving the \(p\)-center location problem
Solving thep-Center problem with Tabu Search and Variable Neighborhood Search
Large-scale local search heuristics for the capacitated vertexp-center problem
The discrete p-dispersion problem
Network and discrete location. Models, algorithms, and applications
Improving the quality of heuristic solutions for the capacitated vertex \(p\)-center problem through iterated greedy local search with variable neighborhood descent
The m-Center Problem
Enhancements to two exact algorithms for solving the vertex \(P\)-center problem
New relaxation-based algorithms for the optimal solution of the continuous and discrete \(p\)-center problems
Optimization by GRASP. Greedy randomized adaptive search procedures
Some Computer Organizations and Their Effectiveness
A scalable exact algorithm for the vertex \(p\)-center problem
Approximation algorithms for the \(k\)-center problem: an experimental evaluation
Title not available (Why is that?)
Mathematical models and search algorithms for the capacitated \(p\)-center problem

This page was built for publication: A constructive heuristic for the uniform capacitated vertex \(k\)-center problem

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6579775)