scientific article; zbMATH DE number 4141774

DOI10.1002/1520-6750(198804)35:2%3C185::AID-NAV3220350204%3E3.0.CO;2-RMaRDI QIDQ3474476zbMATH OpenFDO

Authors Joseph S. Martinich

Publication date 1988

Full work available at URL https://doi.org/10.1002/1520-6750(198804)35:2%3C185::AID-NAV3220350204%3E3.0.CO;2-R

zbMATH Keywords

facility locationp-center problempolynomial algorithmsvertex-closing approach

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Inventory, storage, reservoirs (90B05) Programming involving graphs or networks (90C35)

Recommendations

• A heuristic for the p-center problem in graphs
• Un nuevo resultado sobre la complejidad del problema delP-centro
• Dominant, an algorithm for the \(p\)-center problem.
• The p-Centre Problem-Heuristic and Optimal Algorithms
• On the rectangularp-center problem

Cited in

(7)

• The complete vertex \(p\)-center problem
• On the Solution Value of the Continuous p-Center Location Problem on a Graph
• Solving thep-Center problem with Tabu Search and Variable Neighborhood Search
• A Polynomial Time Approximation Scheme for the Closest Shared Center Problem
• A vertex weighting-based double-tabu search algorithm for the classical p-center problem
• The minimum weight \(t\)-composition of an integer
• Enhancements to two exact algorithms for solving the vertex 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 Q3474476)