Mathematical Programming Formulations for the Bottleneck Hyperplane Clustering Problem

DOI10.1007/978-3-540-87477-5_10zbMath1160.90599OpenAlexW1601105380MaRDI QIDQ3627678

Kanika Dhyani, Leo Liberti

Publication date: 13 May 2009

Published in: Communications in Computer and Information Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-540-87477-5_10

zbMATH Keywords

linearizationMINLPreformulation\(k\)-line center problem

Mathematics Subject Classification ID

Mixed integer programming (90C11) Nonlinear programming (90C30)

Related Items (2)

A spatially constrained fuzzy hyper-prototype clustering algorithm ⋮ Optimization models and algorithms for the hyperplane clustering problem

Uses Software

• UCI-ml
• CPLEX
• alphaBB

Cites Work

• A recipe for finding good solutions to MINLPs
• \(k\)-plane clustering
• On the complexity of locating linear facilities in the plane
• Covering things with things
• Approximation algorithms for projective clustering
• FSTTCS 2004: Foundations of Software Technology and Theoretical Computer Science
• Unnamed Item

This page was built for publication: Mathematical Programming Formulations for the Bottleneck Hyperplane Clustering Problem