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

Clustering of objects and attributes for manufacturing and marketing applications

Author

Listed:
  • Vakharia, Asoo J.
  • Mahajan, Jayashree

Abstract

No abstract is available for this item.

Suggested Citation

  • Vakharia, Asoo J. & Mahajan, Jayashree, 2000. "Clustering of objects and attributes for manufacturing and marketing applications," European Journal of Operational Research, Elsevier, vol. 123(3), pages 640-651, June.
    • Handle: RePEc:eee:ejores:v:123:y:2000:i:3:p:640-651
    as

    Download full text from publisher

    File URL: http://www.sciencedirect.com/science/article/pii/S0377-2217(99)00103-4
    Download Restriction: Full text for ScienceDirect subscribers only
    ---><---

    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. Ng, Shu Ming, 1993. "Worst-case analysis of an algorithm for cellular manufacturing," European Journal of Operational Research, Elsevier, vol. 69(3), pages 384-398, September.
    2. Donald Erlenkotter, 1978. "A Dual-Based Procedure for Uncapacitated Facility Location," Operations Research, INFORMS, vol. 26(6), pages 992-1009, December.
    3. John M. Mulvey & Harlan P. Crowder, 1979. "Cluster Analysis: An Application of Lagrangian Relaxation," Management Science, INFORMS, vol. 25(4), pages 329-340, April.
    4. Robert E. Jensen, 1969. "A Dynamic Programming Algorithm for Cluster Analysis," Operations Research, INFORMS, vol. 17(6), pages 1034-1057, December.
    5. Shu Ming Ng, 1996. "On the Characterization and Measure of Machine Cells in Group Technology," Operations Research, INFORMS, vol. 44(5), pages 735-744, October.
    6. Glenn Milligan, 1980. "An examination of the effect of six types of error perturbation on fifteen clustering algorithms," Psychometrika, Springer;The Psychometric Society, vol. 45(3), pages 325-342, September.
    7. T. D. Klastorin, 1985. "The p-Median Problem for Cluster Analysis: A Comparative Test Using the Mixture Model Approach," Management Science, INFORMS, vol. 31(1), pages 84-95, January.
    8. Mulvey, John M. & Beck, Michael P., 1984. "Solving capacitated clustering problems," European Journal of Operational Research, Elsevier, vol. 18(3), pages 339-348, December.
    9. William T. McCormick & Paul J. Schweitzer & Thomas W. White, 1972. "Problem Decomposition and Data Reorganization by a Clustering Technique," Operations Research, INFORMS, vol. 20(5), pages 993-1009, October.
    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. Ahmadi, Samad & Osman, Ibrahim H., 2005. "Greedy random adaptive memory programming search for the capacitated clustering problem," European Journal of Operational Research, Elsevier, vol. 162(1), pages 30-44, April.
    2. I H Osman & S Ahmadi, 2007. "Guided construction search metaheuristics for the capacitated p-median problem with single source constraint," Journal of the Operational Research Society, Palgrave Macmillan;The OR Society, vol. 58(1), pages 100-114, 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. D'Alfonso, Thomas H. & Ventura, Jose A., 1995. "Assignment of tools to machines in a flexible manufacturing system," European Journal of Operational Research, Elsevier, vol. 81(1), pages 115-133, February.
    2. Lau, Kin-nam & Leung, Pui-lam & Tse, Ka-kit, 1999. "A mathematical programming approach to clusterwise regression model and its extensions," European Journal of Operational Research, Elsevier, vol. 116(3), pages 640-652, August.
    3. Michael Brusco & Douglas Steinley, 2015. "Affinity Propagation and Uncapacitated Facility Location Problems," Journal of Classification, Springer;The Classification Society, vol. 32(3), pages 443-480, October.
    4. Gambella, Claudio & Ghaddar, Bissan & Naoum-Sawaya, Joe, 2021. "Optimization problems for machine learning: A survey," European Journal of Operational Research, Elsevier, vol. 290(3), pages 807-828.
    5. Drexl, Andreas & Klose, Andreas, 2001. "Facility location models for distribution system design," Manuskripte aus den Instituten für Betriebswirtschaftslehre der Universität Kiel 546, Christian-Albrechts-Universität zu Kiel, Institut für Betriebswirtschaftslehre.
    6. Mladenovic, Nenad & Brimberg, Jack & Hansen, Pierre & Moreno-Perez, Jose A., 2007. "The p-median problem: A survey of metaheuristic approaches," European Journal of Operational Research, Elsevier, vol. 179(3), pages 927-939, June.
    7. Dmitry Krushinsky & Boris Goldengorin, 2012. "An exact model for cell formation in group technology," Computational Management Science, Springer, vol. 9(3), pages 323-338, August.
    8. Benati, Stefano & García, Sergio, 2012. "A p-median problem with distance selection," DES - Working Papers. Statistics and Econometrics. WS ws121913, Universidad Carlos III de Madrid. Departamento de Estadística.
    9. V. Choulakian, 2006. "Taxicab Correspondence Analysis," Psychometrika, Springer;The Psychometric Society, vol. 71(2), pages 333-345, June.
    10. Michael Brusco & Hans-Friedrich Köhn, 2009. "Exemplar-Based Clustering via Simulated Annealing," Psychometrika, Springer;The Psychometric Society, vol. 74(3), pages 457-475, September.
    11. Klose, Andreas & Drexl, Andreas, 2005. "Facility location models for distribution system design," European Journal of Operational Research, Elsevier, vol. 162(1), pages 4-29, April.
    12. Torbjörn Larsson & Michael Patriksson, 2006. "Global Optimality Conditions for Discrete and Nonconvex Optimization---With Applications to Lagrangian Heuristics and Column Generation," Operations Research, INFORMS, vol. 54(3), pages 436-453, June.
    13. Mangiameli, Paul & Chen, Shaw K. & West, David, 1996. "A comparison of SOM neural network and hierarchical clustering methods," European Journal of Operational Research, Elsevier, vol. 93(2), pages 402-417, September.
    14. Gary Klein & Jay E. Aronson, 1991. "Optimal clustering: A model and method," Naval Research Logistics (NRL), John Wiley & Sons, vol. 38(3), pages 447-461, June.
    15. Marshall L. Fisher, 2004. "The Lagrangian Relaxation Method for Solving Integer Programming Problems," Management Science, INFORMS, vol. 50(12_supple), pages 1861-1871, December.
    16. Chiou, Yu-Chiun & Lan, Lawrence W., 2001. "Genetic clustering algorithms," European Journal of Operational Research, Elsevier, vol. 135(2), pages 413-427, December.
    17. Antiopi Panteli & Basilis Boutsinas & Ioannis Giannikos, 2021. "On solving the multiple p-median problem based on biclustering," Operational Research, Springer, vol. 21(1), pages 775-799, March.
    18. Canovas, Lazaro & Garcia, Sergio & Marin, Alfredo, 2007. "Solving the uncapacitated multiple allocation hub location problem by means of a dual-ascent technique," European Journal of Operational Research, Elsevier, vol. 179(3), pages 990-1007, June.
    19. Kim, Junyung & Shah, Asad Ullah Amin & Kang, Hyun Gook, 2020. "Dynamic risk assessment with bayesian network and clustering analysis," Reliability Engineering and System Safety, Elsevier, vol. 201(C).
    20. Goethner, Maximilian & Hornuf, Lars & Regner, Tobias, 2021. "Protecting investors in equity crowdfunding: An empirical analysis of the small investor protection act," Technological Forecasting and Social Change, Elsevier, vol. 162(C).

    More about this item

    Statistics

    Access and download statistics

    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:123:y:2000:i:3:p:640-651. 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.