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

DOI10.1145/3604911MaRDI QIDQ6579775zbMATH OpenFDO

Authors José Alejandro Cornejo-Acosta, Jesús García-Díaz, Julio Cesar Perez-Sansalvador, Roger Z. Ríos-Mercado, S. E. Pomares Hernandez

Publication date 26 July 2024

Published in ACM Journal of Experimental Algorithmics (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1145/3604911

zbMATH Keywords

capacitated \(k\)-centercombinatorial optimizationheuristic searchparallel algorithm

Mathematics Subject Classification ID

Algorithms in computer science (68Wxx)

Cites work

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

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)