@inproceedings{02df9e950d854be78dc3c050d1014a94,
title = "Mathematical Programming Formulations for the Bottleneck Hyperplane Clustering Problem",
abstract = "We discuss a mixed-integer nonlinear programming formulation for the problem of covering a set of points with a given number of slabs of minimum width, known as the bottleneck variant of the hyperplane clustering problem. We derive several linear approximations, which we solve using a standard mixed-integer linear programming solver. A computational comparison of the performance of the different linearizations is provided.",
keywords = "MINLP, k-line center problem, linearization, reformulation",
author = "Kanika Dhyani and Leo Liberti",
year = "2008",
month = dec,
day = "1",
doi = "10.1007/978-3-540-87477-5\_10",
language = "English",
isbn = "9783540874768",
series = "Communications in Computer and Information Science",
pages = "87--96",
booktitle = "Modelling, Computation and Optimization in Information Systems and Management Sciences - Second International Conference, MCO 2008, Proceedings",
note = "2nd International conference on Modelling, Computation and Optimization in Information Systems and Management Sciences, MCO 2008 ; Conference date: 08-09-2008 Through 10-09-2008",
}