Preview
Unable to display preview. Download preview PDF.
References
N. Agin "Optimum seeking with Branch and Bound", Mgmt Sci. 13, 176–186, (1966).
S. Ashour "An experimental investigation and comparative evaluation of flow-shop scheduling techniques", Opns. Res. 18, 541–549, (1970).
E. Balas "A note on the Branch — and — Bound Principle", Opns. Res. 16, 442–445, (1968).
E. Biondi, P.C. Palermo, C. Pluchinotta "A heuristic method for a delivery problem", 7-th Mathematical Programming Symposium 1970 The Hague — The Netherlands.
H. Campbell, R. Dudek, M. Smith "A heuristic algorithm for the n job — m machine sequencing problem", Mgmt. Sci. 16, 630–637, (1970).
N. Christofides, S. Eilon "An algorithm for the vehicle dispat ching problem", Opl. Res. Q. 20, 309–318 (1969).
R.J. Giglio, H.M. Wagner "Approximate Solutions to the three-Machine Scheduling Problem", Opns. Res., 305–319 (1964).
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).
M. Held, R.M. Karp "A Dynamic Programming Approach to sequencing problems", J. Soc. ind. appl. Math. 10, 196–208 (1962).
E. Ignall, L. Schrage "Application of the Branch — and — Bound Technique to some flow-shop scheduling problems", Opns. Res. 13, 400–412 (1965).
G.B. McMahon, P.P. Burton "Flow-shop scheduling with Branch — and — Bound method", Opns. Res. 15, 473–481 (1967).
L.G. Mitten "Branch — and — Bound Methods: general formulation and properties", Opns. Res. 16, 442–445, (1968).
P.C. Palermo, M. Tamaccio "A Branch-Search algorithm for a delivery problem" Working Paper LCA 71–4 (1971).
Author information
Authors and Affiliations
Editor information
Rights 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