A method for optimal grouping of vector objects around centers
Keywords:
algorithm, grouping, integer programming, network flow, matroidAbstract
The paper addresses the problem of grouping vector objects around potential centers with respect to restrictions imposed on the group structure. A method for transforming vector restictions into the restictions of equivalent integer programming problem is proposed. Polynomial algorithms for some special cases are suggested.References
Published
2012-03-01
How to Cite
Mustafin, N., Ponomarev, A., & Savosin, S. (2012). A method for optimal grouping of vector objects around centers. SPIIRAS Proceedings, 1(20), 216-230. https://doi.org/10.15622/sp.20.12
Section
Articles
Authors who publish with this journal agree to the following terms:
Authors retain copyright and grant the journal right of first publication with the work simultaneously licensed under a Creative Commons Attribution License that allows others to share the work with an acknowledgement of the work's authorship and initial publication in this journal.
Authors are able to enter into separate, additional contractual arrangements for the non-exclusive distribution of the journal's published version of the work (e.g., post it to an institutional repository or publish it in a book), with an acknowledgement of its initial publication in this journal.
Authors are permitted and encouraged to post their work online (e.g., in institutional repositories or on their website) prior to and during the submission process, as it can lead to productive exchanges, as well as earlier and greater citation of published work (See The Effect of Open Access).
