Performance Prediction and Preselection for Optimization and Heuristic Solution Procedures

References

• Adams J., Balas E., Zawack D. The shifting bottleneck procedure for job shop scheduling. Management Sci. (1988) 34:391–401Link, Google Scholar
• Angel E., Zissimopoulos V. Autocorrelation coefficient for the graph bipartitioning problem. Theoret. Comput. Sci. (1998) 191:229–243Crossref, Google Scholar
• Angel E., Zissimopoulos V. On the classification of NP-complete problems in terms of their correlation coefficient. Discrete Appl. Math. (2000) 99:261–277Crossref, Google Scholar
• Balas E., Zemel E. An algorithm for large zero-one knapsack problems. Oper. Res. (1980) 28:1130–1154Link, Google Scholar
• Bar Yehuda R., Even S. A linear time approximation algorithm for the weighted vertex cover problem. J. Algorithms (1981) 2:198–203Crossref, Google Scholar
• Cheeseman P., Kanefsky B., Taylor W. M., Mylopoulos J., Reiter R. Where the really hard problems are. Proc. IJCAI-91 (1991) San Mateo, CA:331–337Google Scholar
• Chvatal V. A greedy heuristic for the set covering problem. Math. Oper. Res. (1979) 4:233–235Link, Google Scholar
• Coffman E. G., Garey M. R., Johnson D. S., Hochbaum D. S. Approximation algorithms for bin packing. Approximation Algorithms for NP-Hard Problems (1996) (PWS Publishing, Boston, MA) 46–93Chapter 2Google Scholar
• Cox D. R.Planning of Experiments (1958) (John Wiley and Sons, New York) Google Scholar
• Davalo E., Naim P.Neural Networks (1991) (The Macmillan Press, Ltd., London, UK) Crossref, Google Scholar
• Davis M., Putnam H. A computing procedure for quantification theory. J. ACM (1960) 7:201–215Crossref, Google Scholar
• Garfinkel R. S., Gilbert K. C. The bottleneck traveling salesman problem: Algorithms and probabilistic analysis. J. ACM (1978) 25:435–448Crossref, Google Scholar
• Hall N. G., Posner M. E. Generating experimental data for computational testing with machine scheduling applications. Oper. Res. (2001) 49:854–865Link, Google Scholar
• Hall N. G., Kamoun H., Sriskandarajah C. Scheduling in robotic cells: Classification, two and three machine cells. Oper. Res. (1997) 45:421–439Link, Google Scholar
• Hill R. R., Reilly C. H. The effects of coefficient correlation structure in two-dimensional knapsack problems on solution procedure performance. Management Sci. (2002) 46:302–317Link, Google Scholar
• Huberty C. J.Applied Discriminant Analysis (1994) (Wiley Interscience, New York) Google Scholar
• Johnson D. S. The NP-completeness column: An ongoing guide. J. Algorithms (1983) 4:87–100Crossref, Google Scholar
• Johnson D. S., McGeoch L. A., Aarts E. H. L., Lenstra J. K. The traveling salesman problem: A case study in local optimization. Local Search in Combinatorial Optimization (1997) (John Wiley and Sons, New York) 215–310Google Scholar
• Johnson D. S., McGeoch L. A., Gutin G., Punnen A. Experimental analysis of heuristics for the STSP. The Traveling Salesman Problem and Its Variations (2002a) (Springer, New York) 369–443Google Scholar
• Johnson D. S., McGeoch L. A., Gutin G., Punnen A. Experimental analysis of heuristics for the ATSP. The Traveling Salesman Problem and Its Variations (2002b) (Springer, New York) 445–487Google Scholar
• Karp R. M., Miller R. E., Thatcher J. W. Reducibility among combinatorial problems. Complexity of Computer Computations (1972) (Plenum Press, New York) 85–103Crossref, Google Scholar
• Karp R. M. Probabilistic analysis of partitioning algorithms for the traveling-salesman problem in the plane. Math. Oper. Res. (1977) 2:209–224Link, Google Scholar
• Kellerer H., Pferschy U., Pisinger D.Knapsack Problems (2004) (Springer Verlag, Berlin, Germany) Crossref, Google Scholar
• Kleinbaum D. G., Klein M.Logistic Regression (2002) 2nd ed.(Springer, Berlin, Germany) Google Scholar
• Martello S., Toth P. A mixture of dynamic programming and branch-and-bound for the subset-sum problem. Management Sci. (1984) 30:765–771Link, Google Scholar
• Martello S., Toth P. A new algorithm for the 0-1 knapsack problem. Management Sci. (1988) 34:633–644Link, Google Scholar
• Martello S., Toth P. Upper bounds and algorithms for hard 0-1 knapsack problems. Oper. Res. (1997) 45:768–778Link, Google Scholar
• Neter J., Kutner M. H., Nachtsheim C. J., Wasserman W.Applied Linear Statistical Models (1996) 4th ed.(Irwin, Homewood, IL) Google Scholar
• Neto D. M. Efficient cluster compensation for Lin-Kernighan heuristics. (1999) . Ph.D. thesis, Department of Computer Science, University of Toronto, Toronto, Ontario, CanadaGoogle Scholar
• Oliver M. A., Webster R. Kriging: A method of interpolation for geographical information systems. Internat. J. Geographical Inform. Systems (1990) 4:313–332Crossref, Google Scholar
• Papadimitriou C. H., Steiglitz K.Combinatorial Optimization: Algorithms and Complexity (1982) (Prentice-Hall, Englewood Cliffs, NJ) Google Scholar
• Pisinger D. A minimal algorithm for the 0-1 knapsack problem. Oper. Res. (1997) 46:758–767Link, Google Scholar
• Pisinger D. Core problems in knapsack algorithms. Oper. Res. (1999) 47:570–575Link, Google Scholar
• Potts C. N., Van Wassenhove L. N. Algorithms for scheduling a single machine to minimize the weighted number of late jobs. Management Sci. (1988) 34:843–858Link, Google Scholar
• Press S. J., Wilson S. Choosing between logistic regression and discriminant analysis. J. Amer. Statist. Assoc. (1978) 73:699–705Crossref, Google Scholar
• Sahai H., Ageel M. I.The Analysis of Variance: Fixed, Random, and Mixed Models (2000) (Birkhäuser, Boston, MA) Crossref, Google Scholar
• Selman B., Mitchell D., Levesque H. J. Generating hard satisfiability problems. Artificial Intelligence (1996) 81:111–125Crossref, Google Scholar
• Smola A. J., Schölkopf B. A tutorial on support vector regression. Statist. Comput. (2004) 14:199–222Crossref, Google Scholar
• Szwarc W., Grosso A., Della Croce F. Algorithmic paradoxes of the single-machine total tardiness problem. J. Scheduling (2001) 4:93–104Crossref, Google Scholar
• Williams C., Hogg T. Exploiting the deep structure of constraint problems. Artificial Intelligence (1994) 70:73–117Crossref, Google Scholar