A polynomial algorithm for balanced clustering via graph partitioning
Author
Abstract
Suggested Citation
DOI: 10.1016/j.ejor.2020.07.031
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
- Jane, Chin-Chia & Laih, Yih-Wenn, 2005. "A clustering algorithm for item assignment in a synchronized zone order picking system," European Journal of Operational Research, Elsevier, vol. 166(2), pages 489-496, October.
- Eitan Sharon & Meirav Galun & Dahlia Sharon & Ronen Basri & Achi Brandt, 2006. "Hierarchy and adaptivity in segmenting visual scenes," Nature, Nature, vol. 442(7104), pages 810-813, August.
- Caraballo, L.E. & Díaz-Báñez, J.M. & Maza, I. & Ollero, A., 2017. "The block-information-sharing strategy for task allocation: A case study for structure assembly with aerial robots," European Journal of Operational Research, Elsevier, vol. 260(2), pages 725-738.
- Klincewicz, J. G., 1991. "Heuristics for the p-hub location problem," European Journal of Operational Research, Elsevier, vol. 53(1), pages 25-37, July.
Citations
Citations are extracted by the CitEc Project, subscribe to its RSS feed for this item.
Cited by:
- Ah-Pine, Julien, 2022. "Learning doubly stochastic and nearly idempotent affinity matrix for graph-based clustering," European Journal of Operational Research, Elsevier, vol. 299(3), pages 1069-1078.
- Chen, Claire Y.T. & Sun, Edward W. & Miao, Wanyu & Lin, Yi-Bing, 2024. "Reconciling business analytics with graphically initialized subspace clustering for optimal nonlinear pricing," European Journal of Operational Research, Elsevier, vol. 312(3), pages 1086-1107.
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.- Marianov, Vladimir & Serra, Daniel & ReVelle, Charles, 1999.
"Location of hubs in a competitive environment,"
European Journal of Operational Research, Elsevier, vol. 114(2), pages 363-371, April.
- Vladimir Marianov & Daniel Serra & Charles Revelle, 1997. "Location of hubs in a competitive environment," Economics Working Papers 227, Department of Economics and Business, Universitat Pompeu Fabra.
- Kovács, András, 2011. "Optimizing the storage assignment in a warehouse served by milkrun logistics," International Journal of Production Economics, Elsevier, vol. 133(1), pages 312-318, September.
- van Gils, Teun & Ramaekers, Katrien & Braekers, Kris & Depaire, Benoît & Caris, An, 2018. "Increasing order picking efficiency by integrating storage, batching, zone picking, and routing policy decisions," International Journal of Production Economics, Elsevier, vol. 197(C), pages 243-261.
- Grzegorz Tarczyński, 2023. "Linear programming models for optimal workload and batching in pick-and-pass warehousing systems," Operations Research and Decisions, Wroclaw University of Science and Technology, Faculty of Management, vol. 33(3), pages 141-158.
- Kijmanawat, Kerati & Ieda, Hitoshi, 2005. "Development and Application of CM-GATS Algorithms in Solving Large Multilevel Hierarchical Network Design Problems," Research in Transportation Economics, Elsevier, vol. 13(1), pages 121-142, January.
- Pan, Jason Chao-Hsien & Shih, Po-Hsun & Wu, Ming-Hung, 2015. "Order batching in a pick-and-pass warehousing system with group genetic algorithm," Omega, Elsevier, vol. 57(PB), pages 238-248.
- Yu, M. & de Koster, M.B.M., 2007. "Performance Approximation and Design of Pick-and-Pass Order Picking Systems," ERIM Report Series Research in Management ERS-2007-082-LIS, Erasmus Research Institute of Management (ERIM), ERIM is the joint research institute of the Rotterdam School of Management, Erasmus University and the Erasmus School of Economics (ESE) at Erasmus University Rotterdam.
- Kratica, Jozef & Stanimirovic, Zorica & Tosic, Dusan & Filipovic, Vladimir, 2007. "Two genetic algorithms for solving the uncapacitated single allocation p-hub median problem," European Journal of Operational Research, Elsevier, vol. 182(1), pages 15-28, October.
- Li, Xiaowei & Hua, Guowei & Huang, Anqiang & Sheu, Jiuh-Biing & Cheng, T.C.E. & Huang, Fengquan, 2020. "Storage assignment policy with awareness of energy consumption in the Kiva mobile fulfilment system," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 144(C).
- Vladimir Marianov & Daniel Serra, 2000. "Location models for airline hubs behaving as M/D/c queues," Economics Working Papers 453, Department of Economics and Business, Universitat Pompeu Fabra.
- Sophie D. Lapierre & Angel B. Ruiz & Patrick Soriano, 2004. "Designing Distribution Networks: Formulations and Solution Heuristic," Transportation Science, INFORMS, vol. 38(2), pages 174-187, May.
- Sohn, Jinhyeon & Park, Sungsoo, 1997. "A linear program for the two-hub location problem," European Journal of Operational Research, Elsevier, vol. 100(3), pages 617-622, August.
- de Koster, Rene & Le-Duc, Tho & Roodbergen, Kees Jan, 2007. "Design and control of warehouse order picking: A literature review," European Journal of Operational Research, Elsevier, vol. 182(2), pages 481-501, October.
- Roberto Asín Achá & Dorit S. Hochbaum & Quico Spaen, 2020. "HNCcorr: combinatorial optimization for neuron identification," Annals of Operations Research, Springer, vol. 289(1), pages 5-32, June.
- Masae, Makusee & Glock, Christoph H. & Vichitkunakorn, Panupong, 2021. "A method for efficiently routing order pickers in the leaf warehouse," International Journal of Production Economics, Elsevier, vol. 234(C).
- Ebery, Jamie & Krishnamoorthy, Mohan & Ernst, Andreas & Boland, Natashia, 2000. "The capacitated multiple allocation hub location problem: Formulations and algorithms," European Journal of Operational Research, Elsevier, vol. 120(3), pages 614-631, February.
- Mirzaei, Masoud & Zaerpour, Nima & de Koster, René, 2021. "The impact of integrated cluster-based storage allocation on parts-to-picker warehouse performance," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 146(C).
- de Sá, Elisangela Martins & de Camargo, Ricardo Saraiva & de Miranda, Gilberto, 2013. "An improved Benders decomposition algorithm for the tree of hubs location problem," European Journal of Operational Research, Elsevier, vol. 226(2), pages 185-202.
- Skorin-Kapov, Darko & Skorin-Kapov, Jadranka & O'Kelly, Morton, 1996. "Tight linear programming relaxations of uncapacitated p-hub median problems," European Journal of Operational Research, Elsevier, vol. 94(3), pages 582-593, November.
- Sabine Limbourg & Bart Jourquin, 2010. "Market area of intermodal rail‐road container terminals embedded in a hub‐and‐spoke network," Papers in Regional Science, Wiley Blackwell, vol. 89(1), pages 135-154, March.
More about this item
Keywords
Clustering; Dynamic programming; Graph partitioning;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:289:y:2021:i:2:p:456-469. 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.