An LP-based k-means algorithm for balancing weighted point sets
Author
Abstract
Suggested Citation
DOI: 10.1016/j.ejor.2017.04.054
Download full text from publisher
As the access to this document is restricted, you may want to search for a different version of it.
References listed on IDEAS
- Shmuel Onn & Leonard J. Schulman, 2001. "The Vector Partition Problem for Convex Objective Functions," Mathematics of Operations Research, INFORMS, vol. 26(3), pages 583-590, August.
Citations
Citations are extracted by the CitEc Project, subscribe to its RSS feed for this item.
Cited by:
- Steffen Borgwardt & Rafael M. Frongillo, 2019. "Power Diagram Detection with Applications to Information Elicitation," Journal of Optimization Theory and Applications, Springer, vol. 181(1), pages 184-196, April.
- Xiangyan Kong & Zhen Zhang & Qilong Feng, 2023. "On parameterized approximation algorithms for balanced clustering," Journal of Combinatorial Optimization, Springer, vol. 45(1), pages 1-14, January.
- Robertson, Blair & Price, Chris, 2024. "One point per cluster spatially balanced sampling," Computational Statistics & Data Analysis, Elsevier, vol. 191(C).
Most related items
These are the items that most often cite the same works as this one and are cited by the same works as this one.- Frank K. Hwang & Uriel G. Rothblum, 2011. "On the number of separable partitions," Journal of Combinatorial Optimization, Springer, vol. 21(4), pages 423-433, May.
- Shmuel Onn & Uriel G. Rothblum, 2007. "The use of edge-directions and linear programming to enumerate vertices," Journal of Combinatorial Optimization, Springer, vol. 14(2), pages 153-164, October.
- Jia Shu & Chung-Piaw Teo & Zuo-Jun Max Shen, 2005. "Stochastic Transportation-Inventory Network Design Problem," Operations Research, INFORMS, vol. 53(1), pages 48-60, February.
More about this item
Keywords
Linear programming; Data mining; Clustering; k-Means; Weight-balancing;All these keywords.
Statistics
Access and download statisticsCorrections
All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:eee:ejores:v:263:y:2017:i:2:p:349-355. See general information about how to correct material in RePEc.
If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.
If CitEc recognized a bibliographic reference but did not link an item in RePEc to it, you can help with this form .
If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.
For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: Catherine Liu (email available below). General contact details of provider: http://www.elsevier.com/locate/eor .
Please note that corrections may take a couple of weeks to filter through the various RePEc services.