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. S. M. Roberts & Benito Flores, 1966. "An Engineering Approach to the Traveling Salesman Problem," Management Science, INFORMS, vol. 13(3), pages 269-288, November.
    2. 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.
    3. Helmut Steckhan, 1970. "A Theorem on Symmetric Traveling Salesman Problems," Operations Research, INFORMS, vol. 18(6), pages 1163-1167, December.
    4. 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.
    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. Hahsler, Michael & Hornik, Kurt, 2007. "TSPInfrastructure for the Traveling Salesperson Problem," Journal of Statistical Software, Foundation for Open Access Statistics, vol. 23(i02).
    2. repec:jss:jstsof:23:i02 is not listed on IDEAS
    3. 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.
    4. 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.
    5. 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.

    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. José Berenguel & L. Casado & I. García & Eligius Hendrix, 2013. "On estimating workload in interval branch-and-bound global optimization algorithms," Journal of Global Optimization, Springer, vol. 56(3), pages 821-844, July.
    2. 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.
    3. 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.
    4. 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.
    5. 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.
    6. 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.
    7. Nikolakopoulos, Athanassios & Sarimveis, Haralambos, 2007. "A threshold accepting heuristic with intense local search for the solution of special instances of the traveling salesman problem," European Journal of Operational Research, Elsevier, vol. 177(3), pages 1911-1929, March.
    8. 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.
    9. 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.
    10. 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.
    11. Gilbert Laporte, 2009. "Fifty Years of Vehicle Routing," Transportation Science, INFORMS, vol. 43(4), pages 408-416, November.
    12. Ohashi, Kazumasa, 1999. "Dynamic process planning system for a machining center in an FMS environment," International Journal of Production Economics, Elsevier, vol. 60(1), pages 457-464, April.
    13. Luminiţa Nicolescu & Cristina Galalae & Alexandru Voicu, 2013. "Solving a Supply Chain Management Problem to Near Optimality Using Ant Colony Optimization, in an International Context," The AMFITEATRU ECONOMIC journal, Academy of Economic Studies - Bucharest, Romania, vol. 15(33), pages 8-26, February.
    14. 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.
    15. Belhoul, Lyes, 2014. "Résolution de problèmes d'optimisation combinatoire mono et multi-objectifs par énumération ordonnée," Economics Thesis from University Paris Dauphine, Paris Dauphine University, number 123456789/14672 edited by Vanderpooten, Daniel.
    16. Linus Schrage & Kevin Cunningham, 2007. "Broadening the integer programming audience, the LINDO perspective," Annals of Operations Research, Springer, vol. 149(1), pages 177-183, February.
    17. 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.
    18. 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.
    19. Tsubakitani, Shigeru & Evans, James R., 1998. "An empirical study of a new metaheuristic for the traveling salesman problem," European Journal of Operational Research, Elsevier, vol. 104(1), pages 113-128, January.
    20. G Laporte, 2010. "A concise guide to the Traveling Salesman Problem," Journal of the Operational Research Society, Palgrave Macmillan;The OR Society, vol. 61(1), pages 35-40, January.

    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.