Skip to main content
SpringerLink
Log in
Book cover

IFIP Technical Conference on Optimization Techniques

Optimization Techniques 1973: 5th Conference on Optimization Techniques Part I pp 460–470Cite as

A heuristic approach to combinatorial optimization problems

  • Mathematical Programming
  • Conference paper
  • First Online:

  • 1511 Accesses

Part of the book series: Lecture Notes in Computer Science ((LNCS,volume 3))

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

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. N. Agin "Optimum seeking with Branch and Bound", Mgmt Sci. 13, 176–186, (1966).

    Google Scholar 

  2. S. Ashour "An experimental investigation and comparative evaluation of flow-shop scheduling techniques", Opns. Res. 18, 541–549, (1970).

    Google Scholar 

  3. E. Balas "A note on the Branch — and — Bound Principle", Opns. Res. 16, 442–445, (1968).

    Google Scholar 

  4. E. Biondi, P.C. Palermo, C. Pluchinotta "A heuristic method for a delivery problem", 7-th Mathematical Programming Symposium 1970 The Hague — The Netherlands.

    Google Scholar 

  5. H. Campbell, R. Dudek, M. Smith "A heuristic algorithm for the n job — m machine sequencing problem", Mgmt. Sci. 16, 630–637, (1970).

    Google Scholar 

  6. N. Christofides, S. Eilon "An algorithm for the vehicle dispat ching problem", Opl. Res. Q. 20, 309–318 (1969).

    Google Scholar 

  7. R.J. Giglio, H.M. Wagner "Approximate Solutions to the three-Machine Scheduling Problem", Opns. Res., 305–319 (1964).

    Google Scholar 

  8. P. Hart, N.J. Nilsson, B. Raphael "A formal basis of the heu ristic determination of minimum cost paths" IEEE Trans. SSC 4, 100–107 (1968).

    Google Scholar 

  9. M. Held, R.M. Karp "A Dynamic Programming Approach to sequencing problems", J. Soc. ind. appl. Math. 10, 196–208 (1962).

    Article  Google Scholar 

  10. E. Ignall, L. Schrage "Application of the Branch — and — Bound Technique to some flow-shop scheduling problems", Opns. Res. 13, 400–412 (1965).

    Google Scholar 

  11. G.B. McMahon, P.P. Burton "Flow-shop scheduling with Branch — and — Bound method", Opns. Res. 15, 473–481 (1967).

    Google Scholar 

  12. L.G. Mitten "Branch — and — Bound Methods: general formulation and properties", Opns. Res. 16, 442–445, (1968).

    Google Scholar 

  13. P.C. Palermo, M. Tamaccio "A Branch-Search algorithm for a delivery problem" Working Paper LCA 71–4 (1971).

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Istituto di Elettrotecnica ed Elettronica, Politecnico di Milano, Italy

    E. Biondi & P. C. Palermo

Authors
  1. E. Biondi
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. P. C. Palermo
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

R. Conti A. Ruberti

Rights and permissions

Reprints and permissions

Copyright information

© 1973 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Biondi, E., Palermo, P.C. (1973). A heuristic approach to combinatorial optimization problems. In: Conti, R., Ruberti, A. (eds) 5th Conference on Optimization Techniques Part I. Optimization Techniques 1973. Lecture Notes in Computer Science, vol 3. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-06583-0_45

Download citation

  • DOI: https://doi.org/10.1007/3-540-06583-0_45

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-06583-8

  • Online ISBN: 978-3-540-37903-4

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation