Probabilistic analysis of two \(k\)-cluster problems

DOI10.1016/0166-218X(94)90162-7zbMath0804.90094OpenAlexW2154888399MaRDI QIDQ1324688

Colin Cooper

Publication date: 19 January 1995

Published in: Discrete Applied Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0166-218x(94)90162-7

zbMATH Keywords

branch and boundfacility location\(k\)-centre problemstrong linear programming relaxation

Mathematics Subject Classification ID

Integer programming (90C10) Abstract computational complexity for mathematical programming problems (90C60) Linear programming (90C05) Discrete location and assignment (90B80)

Cites Work

• Unnamed Item
• Probabilistic Analysis of Geometric Location Problems
• Probabilistic Analysis of a Relaxation for the k-Median Problem
• Worst-Case and Probabilistic Analysis of a Geometric Location Problem
• Probability Inequalities for Sums of Bounded Random Variables

This page was built for publication: Probabilistic analysis of two \(k\)-cluster problems