Performance prediction and preselection for optimization and heuristic solution procedures

Operations Research

Volumn 55, Issue 4, 2007, Pages 703-716

  Hall, Nicholas G ^a   Posner, Marc E ^b  

^a OHIO STATE UNIVERSITY   (United States)

^b OHIO STATE UNIVERSITY   (United States)

Author keywords

Analysis of algorithms: suboptimal algorithms; Choice of solution procedure; Computational testing; Prediction of solution procedure performance; Programming: integer, algorithms, heuristics; Statistical analysis; Statistics: data analysis

Indexed keywords

COMPUTATIONAL TESTING; SUBOPTIMAL ALGORITHMS;

ALGORITHMS; DATA REDUCTION; DYNAMIC PROGRAMMING; HEURISTIC METHODS; INTEGER PROGRAMMING; PROBLEM SOLVING; STATISTICAL METHODS;

OPTIMIZATION;

EID: 38549095275     PISSN: 0030364X     EISSN: 15265463     Source Type: Journal    
DOI: 10.1287/opre.1070.0398     Document Type: Article

References (40)

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