IDEAS home Printed from https://ideas.repec.org/a/spr/psycho/v43y1978i1p81-91.html
   My bibliography  Save this article

Applications of combinatorial programming to data analysis: The traveling salesman and related problems

Author

Listed:
  • Lawrence Hubert
  • Frank Baker

Abstract

No abstract is available for this item.

Suggested Citation

  • Lawrence Hubert & Frank Baker, 1978. "Applications of combinatorial programming to data analysis: The traveling salesman and related problems," Psychometrika, Springer;The Psychometric Society, vol. 43(1), pages 81-91, March.
    • Handle: RePEc:spr:psycho:v:43:y:1978:i:1:p:81-91
    DOI: 10.1007/BF02294091
    as

    Download full text from publisher

    File URL: http://hdl.handle.net/10.1007/BF02294091
    Download Restriction: Access to full text is restricted to subscribers.
    File URL: https://libkey.io/10.1007/BF02294091?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. Helmut Steckhan, 1970. "A Theorem on Symmetric Traveling Salesman Problems," Operations Research, INFORMS, vol. 18(6), pages 1163-1167, December.
    2. Philip Sagi, 1959. "A statistical test for the significance of a coefficient of reproducibility," Psychometrika, Springer;The Psychometric Society, vol. 24(1), pages 19-27, March.
    3. S. M. Roberts & Benito Flores, 1966. "An Engineering Approach to the Traveling Salesman Problem," Management Science, INFORMS, vol. 13(3), pages 269-288, November.
    4. John D. C. Little & Katta G. Murty & Dura W. Sweeney & Caroline Karel, 1963. "An Algorithm for the Traveling Salesman Problem," Operations Research, INFORMS, vol. 11(6), pages 972-989, December.
    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. repec:jss:jstsof:23:i02 is not listed on IDEAS
    2. Hans-Friedrich Köhn, 2006. "Branch-and-bound applications in combinatorial data analysis," Psychometrika, Springer;The Psychometric Society, vol. 71(2), pages 411-413, June.
    3. Michael Brusco & Hans-Friedrich Köhn, 2008. "Optimal Partitioning of a Data Set Based on the p-Median Model," Psychometrika, Springer;The Psychometric Society, vol. 73(1), pages 89-105, March.
    4. Hahsler, Michael & Hornik, Kurt, 2007. "TSPInfrastructure for the Traveling Salesperson Problem," Journal of Statistical Software, Foundation for Open Access Statistics, vol. 23(i02).
    5. Michael Brusco & Stephanie Stahl, 2001. "An interactive multiobjective programming approach to combinatorial data analysis," Psychometrika, Springer;The Psychometric Society, vol. 66(1), pages 5-24, March.

    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. N. Kazazakis & C. S. Adjiman, 2018. "Arbitrarily tight $$\alpha $$ α BB underestimators of general non-linear functions over sub-optimal domains," Journal of Global Optimization, Springer, vol. 71(4), pages 815-844, August.
    2. Joaquín Antonio Pacheco Bonrostro, 1995. "Problemas de rutas con carga y descarga en sistemas lifo: soluciones exactas," Estudios de Economia Aplicada, Estudios de Economia Aplicada, vol. 3, pages 69-86, Junio.
    3. Tomáš Režnar & Jan Martinovič & Kateřina Slaninová & Ekaterina Grakova & Vít Vondrák, 2017. "Probabilistic time-dependent vehicle routing problem," Central European Journal of Operations Research, Springer;Slovak Society for Operations Research;Hungarian Operational Research Society;Czech Society for Operations Research;Österr. Gesellschaft für Operations Research (ÖGOR);Slovenian Society Informatika - Section for Operational Research;Croatian Operational Research Society, vol. 25(3), pages 545-560, September.
    4. Bogna MRÓWCZYŃSKA, 2015. "Multicriteria vehicle routing problem solved by artificial immune system," Transport Problems, Silesian University of Technology, Faculty of Transport, vol. 10(3), pages 141-152, September.
    5. Michael Windham & J. Hutchinson & Shizuhiko Nishisato & Ludovic Lebart & George Furnas & Richard Dubes & Frank Critchley & A. Gordon & Fionn Murtagh & Ulf Bockenholt & Philip Hopke & Daniel Wartenberg, 1988. "Book reviews," Journal of Classification, Springer;The Classification Society, vol. 5(1), pages 105-154, March.
    6. Schulz, Arne & Pfeiffer, Christian, 2024. "Using fixed paths to improve branch-and-cut algorithms for precedence-constrained routing problems," European Journal of Operational Research, Elsevier, vol. 312(2), pages 456-472.
    7. Zhang Yang & Jiacheng Li & Lei Li, 2020. "Time-Dependent Theme Park Routing Problem by Partheno-Genetic Algorithm," Mathematics, MDPI, vol. 8(12), pages 1-20, December.
    8. A. S. Santos & A. M. Madureira & M. L. R. Varela, 2018. "The Influence of Problem Specific Neighborhood Structures in Metaheuristics Performance," Journal of Mathematics, Hindawi, vol. 2018, pages 1-14, July.
    9. Gilbert Laporte, 2009. "Fifty Years of Vehicle Routing," Transportation Science, INFORMS, vol. 43(4), pages 408-416, November.
    10. Ashayeri, J. & Selen, W., 2007. "A planning and scheduling model for onsertion in printed circuit board assembly," European Journal of Operational Research, Elsevier, vol. 183(2), pages 909-925, December.
    11. Roodbergen, Kees Jan & de Koster, Rene, 2001. "Routing order pickers in a warehouse with a middle aisle," European Journal of Operational Research, Elsevier, vol. 133(1), pages 32-43, August.
    12. R. Dekker & M. B. M. de Koster & K. J. Roodbergen & H. van Kalleveen, 2004. "Improving Order-Picking Response Time at Ankor's Warehouse," Interfaces, INFORMS, vol. 34(4), pages 303-313, August.
    13. Avraham, Edison & Raviv, Tal, 2020. "The data-driven time-dependent traveling salesperson problem," Transportation Research Part B: Methodological, Elsevier, vol. 134(C), pages 25-40.
    14. Gerardo Berbeglia & Jean-François Cordeau & Irina Gribkovskaia & Gilbert Laporte, 2007. "Static pickup and delivery problems: a classification scheme and survey," TOP: An Official Journal of the Spanish Society of Statistics and Operations Research, Springer;Sociedad de Estadística e Investigación Operativa, vol. 15(1), pages 1-31, July.
    15. Carter, Arthur E. & Ragsdale, Cliff T., 2006. "A new approach to solving the multiple traveling salesperson problem using genetic algorithms," European Journal of Operational Research, Elsevier, vol. 175(1), pages 246-257, November.
    16. Öztürkoğlu, Ömer & Hoser, Deniz, 2019. "A discrete cross aisle design model for order-picking warehouses," European Journal of Operational Research, Elsevier, vol. 275(2), pages 411-430.
    17. S. Dharmaraja & Srijan Narang & Vidyottama Jain, 2020. "A mathematical model for supply chain management of blood banks in India," OPSEARCH, Springer;Operational Research Society of India, vol. 57(2), pages 541-552, June.
    18. M. Gaudioso & L. Moccia & M. F. Monaco, 2010. "Repulsive Assignment Problem," Journal of Optimization Theory and Applications, Springer, vol. 144(2), pages 255-273, February.
    19. Steven M. Shugan, 2002. "Editorial: Marketing Science, Models, Monopoly Models, and Why We Need Them," Marketing Science, INFORMS, vol. 21(3), pages 223-228.
    20. Jouglet, Antoine & Carlier, Jacques, 2011. "Dominance rules in combinatorial optimization problems," European Journal of Operational Research, Elsevier, vol. 212(3), pages 433-444, August.

    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:spr:psycho:v:43:y:1978:i:1:p:81-91. 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: Sonal Shukla or Springer Nature Abstracting and Indexing (email available below). General contact details of provider: http://www.springer.com .

    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.