×

zbMATH — the first resource for mathematics

Heuristics and their design: A survey. (English) Zbl 0461.90081

MSC:
90C99 Mathematical programming
90-02 Research exposition (monographs, survey articles) pertaining to operations research and mathematical programming
PDF BibTeX XML Cite
Full Text: DOI
References:
[1] Ackoff, R.L., Science in the systems age: beyond IE, OR and MS, Operations res., 21, 661-671, (1973)
[2] Ackoff, R.L., Optimization + objectivity = opt out, European J. operational res., 1, 1-7, (1977) · Zbl 0366.90034
[3] Ackoff, R.L., The future of operational reseach is past, J. operational res. soc., 30, 93-104, (1979)
[4] Arnoff, E.; Sengupta, S.S., Mathematical programming, (), 105-210
[5] Balas, E.; Padberg, M.W., Set partitioning: a survey, SIAM rev., 18, 710-760, (1976) · Zbl 0347.90064
[6] Balas, E.; Zemel, E., An algorithm for large zero-one knapsack problems, Operations res., 28, 1130-1154, (1980) · Zbl 0449.90064
[7] Brucker, P., Anmerkungen zu heuristischen verfahren, (), 668-676 · Zbl 0392.90060
[8] Burkard, R.E., Heuristische verfahren zur Lösung: quadratischer zuordnungsprobleme, Z. operations res., 19, 183-193, (1975) · Zbl 0311.90054
[9] Busacker, R.G.; Saaty, T.L., Finite graphs and networks, (1965), McGraw-Hill New York · Zbl 0146.20104
[10] Buxey, G.M., The vehicle scheduling problem and Monte Carlo simulation, J. operational res. soc., 30, 563-573, (1979) · Zbl 0397.90047
[11] Camerini, P.M.; Galbiati, G.; Maffioli, F., Complexity of spanning tree problems: part I, European J. operational res., 5, 346-352, (1980) · Zbl 0445.90088
[12] Christofides, N., Graph theory—an algorithmic approach, (1975), Academic Press New York · Zbl 0321.94011
[13] Christofides, N.; Mingozzi, A.; Toth, P., Contribution to the quadratic assignment problem, European J. operational res., 4, 243-247, (1980) · Zbl 0439.90058
[14] Churchman, C.W.; Ackoff, R.L.; Arnoff, E.L., Introduction to operations research, (1957), Wiley New York · Zbl 0153.48902
[15] Chvatal, V., Hard knapsack problems, Operations res., 28, 1402-1411, (1980) · Zbl 0447.90063
[16] Cook, S.A., The complexity of theorem-proving procedures, (), 151-158 · Zbl 0363.68125
[17] Crowder, H.P.; Dembo, R.S.; Mulvey, J.M., Reporting computational experiments in mathematical programming, Math. programming, 15, 316-329, (1978) · Zbl 0389.65031
[18] Crowder, H.P.; Padberg, M.W., Solving large-scale symmetric travelling salesman problems to optimality, Management sci., 26, 495-509, (1980) · Zbl 0444.90068
[19] Dakin, R.J., A tree-search algorithm for mixed integer programming problems, Comput. J., 8, 250-255, (1965) · Zbl 0154.42004
[20] Dannenbring, D.G., Procedures for estimating optimal solution values for large combinatorial problems, Management sci., 23, 1273-1283, (1977) · Zbl 0377.90051
[21] ()
[22] Denardo, E.V.; Fox, B.F., Shortest-route methods: I. reaching, pruning, and buckets, Operations res., 27, 161-186, (1979) · Zbl 0391.90089
[23] de Werra, D., Remarks on the requirement matrix of school timetable problems and regular embeddings of graphs, European J. operational res., 6, 298-301, (1981) · Zbl 0453.90042
[24] ()
[25] Eilon, S., Production scheduling, (), 237-266
[26] Fisher, M.L., Worst-case analysis of heuristic algorithms, Management sci., 26, 1-17, (1980) · Zbl 0448.90041
[27] Fox, B.L.; Lenstra, J.K.; Rinnooy Kan, A.H.G.; Schrage, L.E., Branching from the largest upper bound: folklore and facts, European J. operational res., 2, 191-194, (1978) · Zbl 0381.90075
[28] Freidenfelds, J.; McLaughlin, C.D., A heuristic branch-and-bound algorithm for telephone feeder capacity expansion, Operations res., 27, 567-582, (1979) · Zbl 0403.90086
[29] Fuller, J.A., Optimal solutions versus ‘good’ solutions: an analysis of heuristic decision making, Omega, 6, 479-484, (1978)
[30] Gallus, G., Heuristiche verfahren zur Lösung allgemeiner ganzzahliger linearer optimirungsprobleme (ein überblick), Z. operations res., 20, 89-104, (1976) · Zbl 0351.90075
[31] Golden, B.; Bodin, L.; Doyle, T.; Stewart, W., Approximate traveling salesman algorithms, Operations res., 28, 694-711, (1980) · Zbl 0447.90081
[32] Greenberg, H.; Hegerich, R.L., A branch search algorithm for the knapsack problem, Management sci., 16, 327-332, (1970) · Zbl 0191.48401
[33] Hanssmann, F., Operations research techniques for capital investment, (1968), Wiley New York · Zbl 0164.20502
[34] Held, M.; Karp, R.M., The traveling-salesman problem and minimum spanning trees, Operations res., 18, 1138-1162, (1970) · Zbl 0226.90047
[35] Held, M.; Karp, R.M., The traveling-salesman problem and minimum spanning trees: part II, Math. programming, 1, 6-25, (1971) · Zbl 0232.90038
[36] Hildebrandt, S., Implementation of the operations research/management science process, European J. operational res., 1, 289-294, (1977)
[37] Ignazio, J.P., On the establishment of standards for comparing algorithm performance, Interfaces, 2, 8-11, (1971)
[38] Karp, R.M., Reducibility among combinatorial problems, (), 85-103 · Zbl 0366.68041
[39] Kilbridge, M.D.; Wester, L., A review of analytical systems of line balancing, Operations res., 10, 626-638, (1962)
[40] Klein, H.K., Heuristische entscheidungsmodelle. neue techniken des programmierens und entscheidens für das management, (1971), Gabler Wiesbaden
[41] Knuth, D.E., Computer programming as an art, Comm. ACM, 17, 667-673, (1974) · Zbl 0292.68001
[42] Kolesar, P.J., A branch and bound algorithm for the knapsack problem, Management sci., 13, 723-735, (1967)
[43] Koopmans, T.C.; Beckmann, M.J., Assignment problems and the location of economic activities, Econometrica, 25, 52-76, (1957) · Zbl 0098.12203
[44] Korte, B., Ganzzahlige programmierung—ein überblick, (), 61-127 · Zbl 0269.90033
[45] Kruskal, J.B., On the shortest spanning subtree of a graph and the traveling salesman problem, (), 48-50 · Zbl 0070.18404
[46] Kwan, Mei-Ko, Graphic programming using odd or even points, Chinese math., 1, 273-277, (1962) · Zbl 0143.41904
[47] Land, A.H.; Doig, A.G., An automatic method of solving discrete programming problems, Econometrica, 28, 497-520, (1960) · Zbl 0101.37004
[48] Land, A.H.; Laporte, G.; Miliotis, P., A unified formulation of the machine scheduling problem, European J. operational res., 2, 32-35, (1978) · Zbl 0376.90054
[49] Lashkari, R.S.; Jaisingh, S.C., A heuristic approach to quadratic assignment problem, J. operational res. soc., 31, 845-850, (1980) · Zbl 0448.90013
[50] Lawler, E.L., Combinatorial optimization: networks and matroids, (1976), Holt, Reinhart and Winston New York · Zbl 0358.68059
[51] Lawler, E.L., The quadratic assignment problem: a brief review, (), 351-360 · Zbl 0306.90057
[52] Lawler, E.L.; Wood, D.E., Branch-and-bound methods: a survey, Operations res., 14, 699-719, (1966) · Zbl 0143.42501
[53] Liesegang, G.; Schirmer, A., Heuristische verfahren zur maschinenbelegungsplanung bei reihenfertigung, Z. operations res., 19, 195-211, (1975) · Zbl 0311.90038
[54] Lin, S., Computer solution of the traveling salesman problem, Bell system tech. J., 44, 2245-2269, (1965) · Zbl 0136.14705
[55] Lin, S.; Kernighan, B.W., An effective heuristic algorithm for the traveling-salesman problem, Operations res., 21, 498-516, (1973) · Zbl 0256.90038
[56] Little, J.D.C.; Murty, K.G.; Sweeney, D.W.; Karel, C., An algorithm for the traveling salesman problem, Operations res., 11, 972-989, (1963) · Zbl 0161.39305
[57] Loulou, R.; Michaelides, E., New greedy-like heuristics for the multidimensional 0-1 knapsack problem, Operations res., 6, 1101-1114, (1979) · Zbl 0442.90058
[58] Márquez Diez-Canedo, J.; Medina-Mora Escalante, O., A network solution to a general vehicle scheduling problem, European J. operational res., 1, 255-261, (1977) · Zbl 0366.90058
[59] Marsten, R.E.; Muller, M.P.; Killion, C.L., Crew planning at flying tiger: a successful application of integer programming, Management sci., 25, 1175-1183, (1979)
[60] Martello, S.; Toth, P., Solution of the zero-one multiple knapsack problem, European J. operational res., 4, 276-283, (1980) · Zbl 0439.90059
[61] Matthäus, F.W., Heuristische Lösungsverfahren für lieferplanprobleme, Z. operations res., 19, 163-181, (1975) · Zbl 0311.90037
[62] Matthäus, F.W., Tourenplanung—verfahren zur einsatz-disposition von fuhrparks, (1978), Toeche-Mittler Darmstadt
[63] Meissner, J.-D., Heuristische programmierung, (1978), Akademische Verlagsgesellschaft Wiesbaden
[64] Mitten, L.G., Branch-and-bound methods: general formulation and properties, Operations res., 18, 24-34, (1970) · Zbl 0225.90030
[65] Mole, R.H., A survey of local delivery vehicle routing methodology, J. operational res. soc., 30, 245-252, (1979)
[66] Müller, W., Heuristische verhren der produktions-planung and probleme ihrer beurteilung, (), 77-97
[67] Müller-Merbach, H., Verschiedene Näherungsverfahren zur Lösung des transportproblems, () · Zbl 0173.19507
[68] Müller-Merbach, H., Optimale reihenfolgen, (1970), Springer Berlin · Zbl 0191.48302
[69] Müller-Merbach, H., Operations research, (1973), Vahlen München · Zbl 0205.21501
[70] Müller-Merbach, H., Heuristische verfahren, (), 346-355 · Zbl 0184.23104
[71] Müller-Merbach, H., Heuristic methods: structures, applications, computational experience, (), 401-416
[72] Müller-Merbach, H., Modelling techniques and heuristics for combinatorial problems, (), 3-27 · Zbl 0306.90049
[73] Müller-Merbach, H., Morphologie heuristischer verfahren, Z. operations res., 20, 69-87, (1976)
[74] Müller-Merbach, H., Ansätze zu entwurfsmethodlogien für algorithmen der kombinatorischen optimierung, (), 655-667
[75] Müller-Merbach, H., Ein kaskadenbaumverfahren zur Lösung des ‘knapsackproblems’, Angewandte informatik, 20, 494-505, (1978)
[76] Müller-Merbach, H., Optimierungsmodelle zur ablaufplanung, (), 38-52
[77] Müller-Merbach, H., The modelling process: steps versus components, (), 47-59
[78] Newell, A., Heuristic programming: ill-structured problems, (), 361-414
[79] Nijenhuis, A.; Wilf, H.S., Combinatorial algorithms, (1978), Academic Press New York · Zbl 0298.05015
[80] Norback, J.P.; Love, R.F., Heuristic for the Hamiltonian path problem in Euclidian two space, J. operational res. soc., 30, 363-368, (1979) · Zbl 0398.90101
[81] ()
[82] ()
[83] Papoulias, D.B., The assignment-to-days problems in a school time-table, a heuristic approach, European J. operational res., 4, 31-41, (1980) · Zbl 0418.90052
[84] Papoulias, D.B.; Panayiotopoulos, J.C., Consideration on the requirements matrix of a non-regular school time-table problem, European J. operational res., 3, 382-385, (1979) · Zbl 0407.90041
[85] Potts, C.N., An adaptive branching rule for the permutation flow-shop problem, European J. operational res., 5, 19-25, (1980) · Zbl 0436.90063
[86] ()
[87] Reingold, E.M.; Nievergelt, J.; Deo, N., Combinatorial algorithms—theory and practice, (1977), Prentice-Hall Englewood Cliffs, NJ · Zbl 0367.68032
[88] Reiter, S.; Sherman, G., Discrete optimizing, J. soc. industrial and applied mathematics (SIAM), 13, 864-889, (1965) · Zbl 0163.41201
[89] Ritzman, L.P., The efficiency of computer algorithms for plant layout, Management sci., 18, 240-248, (1972) · Zbl 0252.68015
[90] Ropohl, G.; Ropohl, G., Grundlagen und anwendungsmöglichkeiten der morphologischen methode in forschung und entwicklung, Wirtschaftswissenschaftliches studium, Wirtschaftswisenschaftliches studium, 1, 541-546, (1972)
[91] ()
[92] Schiemenz, B., Optimale adaptive devisenarbitrage, Z. operations res., 17, B97-B110, (1973)
[93] Silver, E.A.; Vidal, R.V.V.; de Werra, D., A tutorial on heuristic methods, European J. operational res., 5, 153-162, (1980)
[94] Streim, H., Heuristische Lösungsverfahren — versuch einer begriffsklärung, Z. operations res., 19, 143-162, (1975) · Zbl 0311.90040
[95] Suhl, U., An algorithm and efficient data structures for the binary knapsack problem, European J. operational res., 2, 420-428, (1978) · Zbl 0402.90067
[96] van Assche, F.; Herroelen, W.S., An optimal procedure for the single-model deterministic assembly line balancing problem, European J. operational res., 3, 142-149, (1979) · Zbl 0392.90035
[97] ()
[98] Wheeling, R.F., Heuristic search: structured problems, (), 317-356
[99] Wilde, D.J., Optimum seeking methods, (1964), Prentice-Hall Englewood Cliffs, NJ · Zbl 0136.14601
[100] Williams, H.P., Experiments in the formulation of integer programming problems, () · Zbl 0353.90062
[101] Witte, Th., Heuristisches planen, (1979), Gabler Wiesbaden
[102] Wolsey, L.A., Heuristic analysis, linear programming and branch and bound, (), 121-134 · Zbl 0442.90061
[103] Zwicky, F., Discovery, invention, research, (1968), MacMillan New York
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.