Contents:
Click here to close this overlay, or press the "Escape" key on your keyboard. Aleksei D Korshunov. Get permission to re-use this article. Create citation alert. Journal RSS feed.
Sign up for new issue notifications. There are many unsolved problems in discrete mathematics and mathematical cybernetics. First, such problems are rather numerous and varied.
Second, they greatly differ from each other in degree of completeness of their solution. An impersonal choice of problems to include is quite hard. This paper includes 13 unsolved problems related to combinatorial mathematics and computational complexity theory. Ahlswede R, Wegener I Suchprobleme. Teubner, Stuttgart Google Scholar. Ahlswede R, Wegener I Search problems. Balkhi Z The optimal search problem theory and computations.
Balkhi Z The generalized linear search problem, existence of optimal search path. Balkhi Z Generalized optimal search paths for continuous univariate random variables. Beck A On the linear search problem. Isr J Math — Google Scholar. Beck A More on the linear search problem. Isr J Math —70 Google Scholar.
Beck A, Beck M Son of the linear search problem. Beck A, Beck M The linear search problems rides again. Beck A, Newman D Yet more on the linear search problem.
Beck A, Warren P The return of the linear search problem. Bellman R Problem , an optimal search.
Franck W An optimal search problem. Fristedt B, Heath D Searching for a particle on the real line. Adv Appl Prob — Google Scholar. Rousseeuw P Optimal search paths for random variables.