×

zbMATH — the first resource for mathematics

Tree-search algorithms for quadratic assignment problems. (English) Zbl 0216.54404

MSC:
90C20 Quadratic programming
90B80 Discrete location and assignment
PDF BibTeX XML Cite
Full Text: DOI
References:
[1] Armour, Management Science 9 pp 294– (1963)
[2] Breuer, Nav. Res. Log. Quart. 13 pp 83– (1966)
[3] Conway, J. Ind. Eng. 12 pp 34– (1961)
[4] ”Linear Programming with Pattern Constraints,” Ph. D. Thesis, Computation Laboratory Report No. B1. 20, Harvard University (1958).
[5] Flood, Operations Research 4 pp 61– (1956)
[6] and , Flows in Networks (Princeton University Press, New Jersey, 1962).
[7] Gaschutz, Nav. Res. Log. Quart. 15 pp 49– (1968) · doi:10.1002/nav.3800150105
[8] Gavett, Operations Research 14 pp 210– (1966)
[9] Geoffrion, SIAM Review 9 pp 178– (1967)
[10] Gilmore, J. Soc. Ind. and Appl. Math. 10 pp 305– (1962)
[11] Golomb, J. Assoc. for Computing Machinery 12 pp 516– (1965) · Zbl 0139.12305 · doi:10.1145/321296.321300
[12] and , ”An Algorithm for the Quadratic Assignment Problem,” Working Paper No. 110, Western Management Service Institute, UCLA, Nov. 1966.
[13] Hillier, J. Ind. Eng. 14 pp 33– (1963)
[14] Hillier, Management Science 13 pp 42– (1966)
[15] Koopmans, Econometrica 25 pp 53– (1957)
[16] Land, Operational Research Quarterly 14 pp 185– (1963)
[17] Land, Econometrica 28 pp 497– (1960)
[18] Lawler, Management Science 9 pp 586– (1963)
[19] ”Notes on the Quadratic Assignment Problem,” Harvard Computation Laboratory, unpublished paper (Apr. 1960).
[20] Little, Operations Research 14 pp 972– (1963)
[21] Markowitz, Econometrica 25 pp 84– (1957)
[22] Maxwell, The International Journal of Production Research 3 pp 177– (1964)
[23] Nugent, Operations Research 16 pp 150– (1968)
[24] Pegels, International Journal of Production Research 5 pp 81– (1966)
[25] and , ”Production Sequencing by Combinatorial Programming,” Operations Research and the Design of Management Information Systems (Ed.) (Tech. Association of the Pulp and Paper Industry, New York, 1967).
[26] and , ”Combinatorial Programming,” Unpublished paper presented at 6th Annual meeting of Operations Research Society of America, Boston, 1958.
[27] ”An Algorithm for Placement of Interconnected Elements Based on Minimum Wire Length,” Proc. AFIPS Spring Joint Computer Conference (1964), p. 477–491.
[28] ”Algorithms for the Solution of the Optimal Cost Traveling Salesman Problem,” Sc. D. Thesis, Washington University, St. Louis, 1966.
[29] ”Solution of Three Related Combinatorial Problems by Network-Flow and Branch and Bound Methods,” Sloan School Working Paper No. 451–70, M. I. T. (Mar. 1970).
[30] Steinberg, Soc. for Ind. and Appl. Math. 3 pp 37– (1961)
[31] Vollman, Management Science 12 pp 450– (1966)
[32] Whitehead, Architect’s Journal 139 pp 1373– (1964)
[33] Wimmert, Journal of Industrial Engineering 9 pp 498– (1958)
This reference list is based on information provided by the publisher or from digital mathematics libraries. Its items are heuristically matched to zbMATH identifiers and may contain data conversion errors. It attempts to reflect the references listed in the original paper as accurately as possible without claiming the completeness or perfect precision of the matching.