Abstract
The RESTART technology is proposed, which allows us to speed up the solution of discrete optimization problems.
Similar content being viewed by others
REFERENCES
I. P. Gent and T. Walsh, “Easy problems are sometimes hard,” Artif. Intel., 70, No. 1, 335-345 (1994).
C. P. Gomes, B. Selman, and H. Kautz, “Boosting combinatorial search through randomization,” in: Proc. AAAI-98, Madison, WI (1998), pp. 1-7.
I. V. Sergienko and V. A. Roshchin, “The method of implicit enumeration for solving some extremum problems on sets,” Obchysl. Prykl. Matem., Ser. Optimizatsiya, 80, 106-118 (1996).
Author information
Authors and Affiliations
Rights and permissions
About this article
Cite this article
Sergienko, I.V., Shilo, V.P. & Roshchin, V.A. RESTART Technology for Solving Discrete Optimization Problems. Cybernetics and Systems Analysis 36, 659–666 (2000). https://doi.org/10.1023/A:1009420604805
Issue Date:
DOI: https://doi.org/10.1023/A:1009420604805