The University of Southampton
University of Southampton Institutional Repository

A distance-based point-reassignment heuristic for the k-hyperplane clustering problem

A distance-based point-reassignment heuristic for the k-hyperplane clustering problem
A distance-based point-reassignment heuristic for the k-hyperplane clustering problem
0377-2217
22-29
Amaldi, Edoardo
eefad18b-86c1-4a8f-a931-23e8ddd59d6e
Coniglio, Stefano
03838248-2ce4-4dbc-a6f4-e010d6fdac67
Amaldi, Edoardo
eefad18b-86c1-4a8f-a931-23e8ddd59d6e
Coniglio, Stefano
03838248-2ce4-4dbc-a6f4-e010d6fdac67

Amaldi, Edoardo and Coniglio, Stefano (2013) A distance-based point-reassignment heuristic for the k-hyperplane clustering problem. European Journal of Operational Research, 227 (1), 22-29.

Record type: Article

Full text not available from this repository.

More information

Published date: 2013
Organisations: Operational Research

Identifiers

Local EPrints ID: 410170
URI: https://eprints.soton.ac.uk/id/eprint/410170
ISSN: 0377-2217
PURE UUID: 3da28a70-c73e-45da-80b7-ea04b790aeb0
ORCID for Stefano Coniglio: ORCID iD orcid.org/0000-0001-9568-4385

Catalogue record

Date deposited: 06 Jun 2017 04:02
Last modified: 24 May 2019 00:29

Export record

Contributors

Author: Edoardo Amaldi

University divisions

Download statistics

Downloads from ePrints over the past year. Other digital versions may also be available to download e.g. from the publisher's website.

View more statistics

Atom RSS 1.0 RSS 2.0

Contact ePrints Soton: eprints@soton.ac.uk

ePrints Soton supports OAI 2.0 with a base URL of https://eprints.soton.ac.uk/cgi/oai2

This repository has been built using EPrints software, developed at the University of Southampton, but available to everyone to use.

We use cookies to ensure that we give you the best experience on our website. If you continue without changing your settings, we will assume that you are happy to receive cookies on the University of Southampton website.

×