Un nuevo resultado sobre la complejidad del problema delP-centro

DOI10.1007/BF02888418zbMath0692.90042OpenAlexW1995647487MaRDI QIDQ3035114

No author found.

Publication date: 1990

Published in: Trabajos de Investigacion Operativa (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/bf02888418

zbMATH Keywords

facility locationundirected graphp-centerlocal centerp-radius

Mathematics Subject Classification ID

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

Cites Work

• A correction to the definition of local center
• An efficient heuristic for large set covering problems
• An Algorithmic Approach to Network Location Problems. I: Thep-Centers
• Set covering algorithms using cutting planes, heuristics, and subgradient optimization: A computational study
• Optimum Distribution of Switching Centers in a Communication Network and Some Related Graph Theoretic Problems
• The m-Center Problem
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Un nuevo resultado sobre la complejidad del problema delP-centro