Lexicographic local search and the \(p\)-center problem.

DOI10.1016/S0377-2217(02)00825-1zbMath1053.90052MaRDI QIDQ1410610

Refael Hassin, Dana Morad, Asaf Levin

Publication date: 14 October 2003

Published in: European Journal of Operational Research (Search for Journal in Brave)

zbMATH Keywords

HeuristicsFacility planning

Mathematics Subject Classification ID

Search theory (90B40) Approximation methods and heuristics in mathematical programming (90C59)

Related Items (4)

Bee colony optimization for the \(p\)-center problem ⋮ Insertion heuristics for central cycle problems ⋮ Data Exploration by Representative Region Selection: Axioms and Convergence ⋮ Exploiting flat subspaces in local search for \(p\)-center problem and two fault-tolerant variants

Uses Software

• TSPLIB

Cites Work

• A simple heuristic for the p-centre problem
• Solution of large-scale symmetric travelling salesman problems
• A heuristic for the p-center problem in graphs
• Optimal packing and covering in the plane are NP-complete
• Unrelated parallel machine scheduling using local search
• The p-Centre Problem-Heuristic and Optimal Algorithms
• A Best Possible Heuristic for the k-Center Problem
• Location-Allocation Problems
• On Syntactic versus Computational Views of Approximability
• Approximating the Minimum-Degree Steiner Tree to within One of Optimal
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Lexicographic local search and the \(p\)-center problem.