Mathematical Programming Formulations for the Bottleneck Hyperplane Clustering Problem

Communications in Computer and Information Science

Volumn 14, Issue , 2008, Pages 87-96

  Dhyani, Kanika ^a,b   Liberti, Leo ^a  

^a ÉCOLE POLYTECHNIQUE   (France)

^b POLITECNICO DI MILANO   (Italy)

Author keywords

k line center problem; linearization; MINLP; reformulation

Indexed keywords

CENTER PROBLEMS; COMPUTATIONAL COMPARISONS; HYPERPLANE CLUSTERING; LINEAR APPROXIMATIONS; MINLP; MIXED INTEGER LINEAR PROGRAMMING; MIXED-INTEGER NONLINEAR PROGRAMMING; REFORMULATION;

GEOMETRY; INFORMATION SYSTEMS; LINEAR PROGRAMMING; MANAGEMENT SCIENCE; NONLINEAR PROGRAMMING; OPTIMIZATION;

LINEARIZATION;

EID: 77952875726     PISSN: 18650929     EISSN: None     Source Type: Book Series    
DOI: 10.1007/978-3-540-87477-5_10     Document Type: Conference Paper

References (14)

1. Agarwal, P.K., Procopiuc, C.M.: Approximation algorithms for projective clustering. Journal of Algorithms 46, 115-139 (2003)
2. Amaldi, E., Ceselli, A., Dhyani, K.: Column generation for the min-hyperplane clustering problem. In: 7th Cologne-Twente Workshop on Graphs and Combinatorial Optimization (2008)
3. Asuncion, A., Newman, D.J.: UCI machine learning repository, University of California, Irvine, School of Information and Computer Sciences (2007), http://www.ics.uci.edu/mlearn/MLRepository.html
4. Bradley, P.S., Mangasarian, O.L.: k-Plane clustering. J. of Global Optimization 16(1), 23-32 (2000)
5. Coniglio, S., Italiano, F.: Hyperplane clustering and piecewise linear model fitting. Master's thesis, DEI, Politecnico di Milano (2007)
6. Har-Peled, S.: No coreset, no cry. In: Lodaya, K., Mahajan, M. (eds.) FSTTCS 2004. LNCS, vol. 3328, pp. 324-335. Springer, Heidelberg (2004)
7. ILOG. ILOG CPLEX 11.0 User's Manual. ILOG S.A, Gentilly, France (2008)
8. Langerman, S., Morin, P.: Covering things with things. Discrete Computational Geometry 33(4), 717-729 (2005)
9. Liberti, L.: Writing global optimization software. In: Liberti, L., Maculan, N. (eds.) Global Optimization: from Theory to Implementation, pp. 211-262. Springer, Berlin (2006)
10. Liberti, L.: Reformulation techniques in mathematical programming, Th'ese d'Habilitationá Diriger des Recherches (November 2007)
11. Liberti, L.: Reformulations in mathematical programming: Definitions. In: Aringhieri, R., Cordone, R., Righini, G. (eds.) Proceedings of the 7th Cologne-Twente Workshop on Graphs and Combinatorial Optimization, Crema, pp. 66-70. Universitá Statale di Milano (2008)
12. Liberti, L., Mladenovíc, N., Nannicini, G.: A good recipe for solving MINLPs. In: Maniezzo, V. (ed.) Proceedings of Matheuristics 2008 Conference, Bertinoro (2008)
13. Megiddo, N., Tamir, A.: On the complexity of locating linear facilities in the plane. Operations Research Letters 1, 194-197 (1982)
14. Mishra, N., Motwani, R., Vassilvitskii, S.: Sublinear projective clustering with outliers. In: 15th Annual Fall Workshop on Computational Geometry and Visualization (2005)