GRASP and VNS for solving the \(p\)-next center problem

DOI10.1016/j.cor.2018.12.017zbMath1458.90446OpenAlexW2905946731WikidataQ128776611 ScholiaQ128776611MaRDI QIDQ1725619

Ana D. López-Sánchez, Alfredo G. Hernández-Díaz, Jesús Sánchez-Oro

Publication date: 14 February 2019

Published in: Computers \& Operations Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.cor.2018.12.017

zbMATH Keywords

GRASPVNSdiscrete location\(p\)-center problem\(p\)-next center problem

Mathematics Subject Classification ID

Combinatorial optimization (90C27) Discrete location and assignment (90B80)

Related Items (6)

GRASP with strategic oscillation for the \(\alpha \)-neighbor \(p\)-center problem ⋮ An iterated greedy algorithm for finding the minimum dominating set in graphs ⋮ Efficient iterated greedy for the two-dimensional bandwidth minimization problem ⋮ Dynamically second-preferred \(p\)-center problem ⋮ Exact solution approaches for the discrete α‐neighbor p‐center problem ⋮ Exploiting flat subspaces in local search for \(p\)-center problem and two fault-tolerant variants

Uses Software

• GRASP
• OR-Library

Cites Work

• Unnamed Item
• Double bound method for solving the \(p\)-center location problem
• When centers can fail: a close second opportunity
• Bee colony optimization for the \(p\)-center problem
• A probabilistic heuristic for a computationally difficult set covering problem
• Variable neighborhood search
• The probabilistic \(p\)-center problem: planning service for potential customers
• Variable neighborhood search: basics and variants
• Greedy randomized adaptive search procedures
• Solving dynamic memory allocation problems in embedded systems with parallel variable neighborhood search strategies
• A New Formulation and Resolution Method for the p-Center Problem
• An annotated bibliography of GRASP-Part II: Applications
• An annotated bibliography of GRASP – Part I: Algorithms
• A Greedy Randomized Adaptive Search Procedure for Maximum Independent Set
• Solving thep-Center problem with Tabu Search and Variable Neighborhood Search
• Parallel variable neighbourhood search strategies for the cutwidth minimization problem
• The m-Center Problem
• Optimum Locations of Switching Centers and the Absolute Centers and Medians of a Graph

This page was built for publication: GRASP and VNS for solving the \(p\)-next center problem