On Maximum Speedup Ratio of Restart Algorithm Portfolios

References

• Chabrier A, Danna E, Le Pape C, Perron L. Solving a network design problem. Ann. Oper. Res. (2004) 130(1–4):217–239Crossref, Google Scholar
• Chen H, Gomes CP, Selman B, Walsh T. Formal models of heavy-tailed behavior in combinatorial search. CP '01: Proc. 7th Internat. Conf. Principles and Practice of Constraint Programming (2001) (Springer Verlag, Berlin) 408–421Crossref, Google Scholar
• CPLEX IBM ILOG CPLEX V12.1, User's Manual for CPLEX. (2009) . ftp://ftp.software.ibm.com/software/websphere/ilog/docs/optimization/cplex/ps_usrmancplex.pdfGoogle Scholar
• D'Apuzzo MM, Migdalas A, Pardalos PM, Toraldo G, Kontoghiorghes EJ. Parallel computing in global optimization. Handbook of Parallel Computing and Statistics (2006) (Chapman and Hall/CRC, Boca Raton, FL) 225–258Google Scholar
• Glover F, Kochenberger GA. Handbook of Metaheuristics (2003) (Kluwer, Dordrecht) Crossref, Google Scholar
• Glover F, Laguna M. Tabu search. IEEE Trans. Inform. Theory (1990) 36(6):1487–1494Crossref, Google Scholar
• Gomes CP, Selman B. Algorithm portfolios. Artif. Intell. (2001) 126(1–2):43–62Crossref, Google Scholar
• Gomes CP, Selman B, Kautz H. Boosting combinatorial search through randomization. Proc. 15th National Conf. Artificial Intelligence (1998) Madison WI:431–437Google Scholar
• Huberman BA, Lukose RM, Hogg T. An economics approach to hard computational problems. Science (1997) 275(5296):51–54Crossref, Google Scholar
• Kao M-Y, Ma Y, Sipser M, Yin Y. Optimal constructions of hybrid algorithms. SODA '94: Proc. Fifth Annual ACM-SIAM Sympos. Discrete Algorithms (1994) (Society for Industrial and Applied Mathematics, Philadelphia) 372–381Google Scholar
• Luby M, Ertel W, Enjalbert P, Mayr EW, Wagner KW. Optimal parallelization of Las Vegas algorithms. STACS '94: Proc. 11th Annual Sympos. Theoret. Aspects Comput. Sci. (1994) (Springer, Berlin) 463–474Crossref, Google Scholar
• Luby M, Sinclair A, Zuckerman D. Optimal speedup of Las Vegas algorithms. Inform. Process. Lett. (1993) 47(4):173–180Crossref, Google Scholar
• Maurer SM, Hogg T, Huberman BA. Portfolios of quantum algorithms. Phys. Rev. Lett. (2001) 87(25):257901Crossref, Google Scholar
• Nowicki E, Smutnicki C. An advanced Tabu search algorithm for the job shop problem. J. Scheduling (2005) 8(2):145–159Crossref, Google Scholar
• Palubeckis G. Multistart Tabu search strategies for the unconstrained binary quadratic optimization problem. J. Ann. Oper. Res. (2004) 131(1–4):259–282Crossref, Google Scholar
• Resende MGC, de Sousa JP. Metaheuristics: Computer Decision-Making (2004) (Kluwer Academic Publishers, The Netherlands) Crossref, Google Scholar
• Resende MGC, Ribeiro CC. Restart strategies for grasp with path-relinking heuristics. Optim. Lett. (2011) 5(3):467–478Crossref, Google Scholar
• Sergienko IV, Shilo VP, Roshchin VA. Restart technology for solving discrete optimization problems. Cybernetics Sys. Anal. (2000) 36(5):659–666Crossref, Google Scholar
• Sergienko IV, Shilo VP, Roshchin VA. Optimization parallelizing for discrete programming problems. Cybernetics Sys. Anal. (2004) 40(2):184–189Crossref, Google Scholar
• Shylo OV, Middelkoop T, Pardalos PM. Restart strategies in optimization: Parallel and serial cases. Parallel Comput. (2011a) 37(1):60–68Crossref, Google Scholar
• Shylo OV, Prokopyev OA, Rajgopal J. On algorithm portfolios and restart strategies. Oper. Res. Lett. (2011b) 39(1):49–52Crossref, Google Scholar