Skip to main content
SpringerLink
Log in

Modelling Techniques and Heuristics for Combinatorial Problems

  • Conference paper
Combinatorial Programming: Methods and Applications

Part of the book series: NATO Advanced Study Institutes Series ((ASIC,volume 19))

Abstract

This paper will give a survey of the different methods to approach combinatorial optimization problems. The main emphasis will lie upon integer programming modelling, tree-search (branch and bound) methods, and heuristic methods. The paper is divided into the following sections: 1. Objectives of the paper; 2. Morphology of combinatorial problems; 3. The general approach to solving combinatorial problems; 4. Integer programming formulations; 5. Explicit enumeration; 6. Tree-search (branch and bound) methods; 7. Heuristic methods; 8. Conclusions.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Log in via an institution
Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Similar content being viewed by others

References

  1. E.M. Beale, J.A. Tomlin, An Integer Programming Approach to a Class of Combinatorial Problems, Mathematical Programming (3), 3 1972), pp. 339–344.

    Article  MathSciNet  MATH  Google Scholar 

  2. R.E. Bellman, Dynamic Programming Treatment of the Traveling Salesman Problem, J. ACM (1), 9 (1962), pp. 61–63.

    Article  MATH  Google Scholar 

  3. R.E. Bellman, S.E. Dreyfus, Applied Dynamic Programming, Princeton University Press, Princeton, 1962.

    MATH  Google Scholar 

  4. M. Bellmore, G.L. Nemhauser, The Traveling Salesman Problem: A Survey, Opns. Res. (3), 16 (1968), pp.538–558.

    Article  MathSciNet  MATH  Google Scholar 

  5. R.J. Dakin, A Tree-Search Algorithm for Mixed Integer Programming Problems, Comput. J. (3), 8 (1963), pp. 250–255.

    Article  MathSciNet  Google Scholar 

  6. G.B. Dantzig, D.R. Fulkerson, S.M. Johnson, Solution of a Large-Scale Traveling-Salesman Problem, Opns. Res. (4) 2, (1954), PP. 393–410.

    Article  MathSciNet  Google Scholar 

  7. G.B. Dantzig, D.R. Fulkerson, S.M. Johnson, On a Linear-Programming, Combinatorial Approach to the Traveling-Salesman Problem, Opns. Res. (1), 7 (1959), pp. 58–66.

    Article  MathSciNet  Google Scholar 

  8. W.L. Eastman, Linear Programming with Pattern Constraints (Diss.), Harvard University, Cambridge, 1958.

    Google Scholar 

  9. L.R. Ford, D.R. Fulkerson, Flows in Networks, Princeton University Press, Princeton, 1962.

    MATH  Google Scholar 

  10. G. Gallus, Die Erweiterung linearer Optimierungsmodelle um fixe Grundkosten (Diss.), Darmstadt, 1974.

    Google Scholar 

  11. C. Gerhardt, Gedanken zur Lösung des Knapsack-Problems, Ablauf- und Planungsforschung (2), 11 (1970), pp. 69–83.

    MathSciNet  Google Scholar 

  12. R.H. Gonzales, Solution of the Traveling Salesman Problem by Dynamic Programming on the Hypercube, Interim Technical Report No. 18, OR Center, MIT, Cambridge, 1962.

    Google Scholar 

  13. H. Greenberg, R.L. Hegerich, A Branch Search Algorithm for the Knapsack Problem, Mgmt. Sci. (5), 16 (1970), pp. 327–332.

    Article  MathSciNet  MATH  Google Scholar 

  14. M. Held, R.M. Karp, A Dynamic Programming Approach to Sequencing Problems, SIAM J. Appl. Math. (1), 10 (1962), pp. 196–210.

    Article  MathSciNet  MATH  Google Scholar 

  15. M. Held, R.M. Karp, The Construction of Discrete Dynamic Programming Algorithms, IBM Systems J. (2), 4 (1965), pp. 136–147.

    Article  Google Scholar 

  16. M. Held, R.M. Karp, The Traveling-Salesman Problem and Minimum Spanning Trees, Opns. Res. (6), 18 (1970), pp. 1138–1162.

    Article  MathSciNet  MATH  Google Scholar 

  17. M. Held, R.M. Karp, The Traveling-Salesman Problem and Minimum Spanning Trees: Part II, Math. Prog. (1), 1 (1971), pp. 6–25.

    Article  MathSciNet  MATH  Google Scholar 

  18. G.P. Ingargiola, J.F. Korsh, A Reduction Algorithm for the Zero-One Knapsack Problems, Mgmt. Sci. (4), 20 (1973), pp. 460–463.

    Article  MATH  Google Scholar 

  19. G. Jaeschke, Vicinal Sequencing Problems, Opns. Res. (5), 20 (1972), pp. 984–992.

    Article  MathSciNet  MATH  Google Scholar 

  20. P. Kolesar, A Branch and Bound Algorithm for the Knapsack Problem, Mgmt. Sci. (9), 13 (1967), pp. 723–735.

    Article  Google Scholar 

  21. A.H. Land, A.G. Doig, An automatic Method of Solving Discrete Programming Problems, Econometrica (3), 28 (1960), pp. 497–520.

    Article  MathSciNet  MATH  Google Scholar 

  22. E.L. Lavier, The Quadratic Assignment Problem, Mgmt. Sci. (6), 9 (1963), pp. 586–599.

    Google Scholar 

  23. E.L. Lavier, D.E. Wood, Branch and Bound Methods: A Survey, Opns. Res. (4), 14 (1966), pp. 699–719.

    Article  Google Scholar 

  24. J.D.C. Little, K.G. Murty, D.W. Sveeney, C. Karel, An Algorithm for the Traveling Salesman Problem, Opns. Res. (12), 11 (1963), pp. 972–989.

    Article  MATH  Google Scholar 

  25. H. Müller-Merbach, Operations Research, Vahlen-Verlag, Berlin 1969, 3rd ed., Munich 1973.

    Google Scholar 

  26. H. Miiller-Merbach, Optimale Reihenfolgen, Springer-Verlag, Berlin/Heidelberg/Nev York, 1970.

    Google Scholar 

  27. H. Miiller-Merbach, The Minimal Co’st Maximum Matching of a Graph (Supplementary Remarks), Unternehmensforschung (3), 15 (1971), pp. 211–213.

    Article  MathSciNet  Google Scholar 

  28. H. Miiller-Merbach, Heuristic Methods: Structures, Applications, Computational Experience, Optimization Methods for Resource Allocation (ed. R. Cottle, J. Krarup), English Universities Press, London, 1974, pp. 401–416.

    Google Scholar 

  29. H. Miiller-Merbach, Heuristische Verfahren, Management Enzyklopädie (Ergänzungsband), Verlag Moderne Industrie, München, 1973, pp. 346–355.

    Google Scholar 

  30. H. Miiller-Merbach, Heuristische Verfahren und Entscheidungs-baumverfahren des Operations Research, Handwörterbuch der Betriebsvirtschaft (4th ed.; ed. E. Grochla, W. Wittmann), Poeschel Verlag, Stuttgart, 1974, to appear.

    Google Scholar 

  31. P.Williams, Experiments in the Formulation of Integer Programming Problems, Mathematical Programming, to appear.

    Google Scholar 

  32. F. Zvicky, Discovery, Invention, Research, Mac Millan, New York, 1968.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Fachgebiet Betriebswirtschaftslehre (Operations Research), Technische Hochschule Darmstadt, D-61, Darmstadt, Germany

    H. Müller-Merbach

Authors
  1. H. Müller-Merbach
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Université de Paris, France

    B. Roy (Professeur et Conseiller Scientifique) (Professeur et Conseiller Scientifique)

  2. SEMA, France

    B. Roy (Professeur et Conseiller Scientifique) (Professeur et Conseiller Scientifique)

Rights and permissions

Reprints and permissions

Copyright information

© 1975 D. Reidel Publishing Company, Dordrecht-Holland

About this paper

Cite this paper

Müller-Merbach, H. (1975). Modelling Techniques and Heuristics for Combinatorial Problems. In: Roy, B. (eds) Combinatorial Programming: Methods and Applications. NATO Advanced Study Institutes Series, vol 19. Springer, Dordrecht. https://doi.org/10.1007/978-94-011-7557-9_1

Download citation

  • DOI: https://doi.org/10.1007/978-94-011-7557-9_1

  • Publisher Name: Springer, Dordrecht

  • Print ISBN: 978-94-011-7559-3

  • Online ISBN: 978-94-011-7557-9

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation