scientific article; zbMATH DE number 4209906

MaRDI QIDQ3358522zbMATH OpenFDO

Authors G. Handler

Publication date 1990

zbMATH Keywords

absolute p-center problemfinite arc setfinite vertex setundirected network

Mathematics Subject Classification ID

Research exposition (monographs, survey articles) pertaining to operations research and mathematical programming (90-02) Computational methods for problems pertaining to operations research and mathematical programming (90-08) Discrete location and assignment (90B80) Programming involving graphs or networks (90C35) Abstract computational complexity for mathematical programming problems (90C60)

Recommendations

• A note on the p-center problem
• On alternativep-center problems
• A Note on p-Center Problems in the Plane
• scientific article; zbMATH DE number 219845
• Conditional p-Center Problems
• Technical Note—The Discrete Anti-P-Center Problem
• On the rectangularp-center problem
• The p-center location problem in an area
• scientific article; zbMATH DE number 849074
• Discrete center problems

Cited in

(12)

• Restricted center problems under polyhedral gauges
• Integer programming formulations of discrete hub location problems
• The \(p\) maximal cover -- \(p\) partial center problem on networks
• Center problems with pos/neg weights on trees
• The complete vertex \(p\)-center problem
• The minimum equitable radius location problem with continuous demand
• An algebraic model for the center problem
• Facility location for large-scale emergencies
• Maximizing the minimum cover probability by emergency facilities
• The Problem K-Means and Given J-Centers: Polynomial Solvability in One Dimension
• Bee colony optimization for the \(p\)-center problem
• The center problem. A view from the normal form theory

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 Q3358522)