IDEAS home Printed from https://ideas.repec.org/a/eee/ejores/v263y2017i2p349-355.html
   My bibliography  Save this article

An LP-based k-means algorithm for balancing weighted point sets

Author

Listed:
  • Borgwardt, S.
  • Brieden, A.
  • Gritzmann, P.

Abstract

The classical k-means algorithm for partitioning n points in Rd into k clusters is one of the most popular and widely spread clustering methods. The need to respect prescribed lower bounds on the cluster sizes has been observed in many scientific and business applications.

Suggested Citation

  • Borgwardt, S. & Brieden, A. & Gritzmann, P., 2017. "An LP-based k-means algorithm for balancing weighted point sets," European Journal of Operational Research, Elsevier, vol. 263(2), pages 349-355.
    • Handle: RePEc:eee:ejores:v:263:y:2017:i:2:p:349-355
    DOI: 10.1016/j.ejor.2017.04.054
    as

    Download full text from publisher

    File URL: http://www.sciencedirect.com/science/article/pii/S0377221717304010
    Download Restriction: Full text for ScienceDirect subscribers only
    File URL: https://libkey.io/10.1016/j.ejor.2017.04.054?utm_source=ideas
    LibKey link: if access is restricted and if your library uses this service, LibKey will redirect you to where you can use your library subscription to access this item
    ---><---

    As the access to this document is restricted, you may want to search for a different version of it.

    References listed on IDEAS

    as
    1. 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.
    Full references (including those not matched with items on IDEAS)

    Citations

    Citations are extracted by the CitEc Project, subscribe to its RSS feed for this item.
    as


    Cited by:

    1. 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.
    2. 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.

    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.
    1. 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.
    2. 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.
    3. 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.

    Corrections

    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.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.