Zobrazeno 1 - 10
of 16
pro vyhledávání: '"Oleg V. Shylo"'
Publikováno v:
INFORMS Journal on Computing. 28:657-673
Many patients face difficulties when accessing medical facilities, particularly in rural areas. To alleviate these concerns, medical centers may offer transportation to eligible patients. However, the operation of such services is typically not tight
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::eb7f0a6f981751dec67777fb34b87858
https://doi.org/10.1287/ijoc.2016.0706
https://doi.org/10.1287/ijoc.2016.0706
Publikováno v:
INFORMS Journal on Computing. 25:682-692
Scheduling elective procedures in an operating suite is a formidable task because of competing performance metrics and uncertain surgery durations. In this paper, we present an optimization framework for batch scheduling within a block booking system
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::2f700c512ffd32152aca6f6d18dde7e7
https://doi.org/10.1287/ijoc.1120.0530
https://doi.org/10.1287/ijoc.1120.0530
Publikováno v:
INFORMS Journal on Computing. 25:222-229
We discuss two possible parallel strategies for randomized restart algorithms. Given a set of available algorithms, one can either choose the best performing algorithm and run its multiple copies in parallel (single algorithm portfolio) or choose som
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::b271a289c4b67b5cb363e21f7f00dc3d
https://doi.org/10.1287/ijoc.1120.0497
https://doi.org/10.1287/ijoc.1120.0497
Autor:
Volodymyr P. Shylo, Oleg V. Shylo
Publikováno v:
International Journal of Swarm Intelligence Research. 2:42-51
In this paper, the potential of the path relinking method for the maximum cut problem is investigated. This method is embedded within global equilibrium search to utilize the set of high quality solutions provided by the latter. The computational exp
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::57bdb5873dfa69e70f1ad3174b5d826f
https://doi.org/10.4018/jsir.2011040103
https://doi.org/10.4018/jsir.2011040103
Publikováno v:
Operations Research Letters. 39:49-52
We consider two parallel strategies for randomized restart algorithms. Given a set of available algorithms, one can either choose the best performing algorithm and run multiple copies of it in parallel (single algorithm portfolio), or choose some sub
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::34eb7dd4fd81aaa72488a8aec6f1f953
https://doi.org/10.1016/j.orl.2010.10.003
https://doi.org/10.1016/j.orl.2010.10.003
Publikováno v:
Parallel Computing. 37:60-68
This paper addresses the problem of minimizing the average running time of the Las Vegas type algorithm, both in serial and parallel setups. The necessary conditions for the existence of an effective restart strategy are presented. We clarify the cou
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::ad3bf14fccf912a0f370bf9389594297
https://doi.org/10.1016/j.parco.2010.08.004
https://doi.org/10.1016/j.parco.2010.08.004
Publikováno v:
Journal of Combinatorial Optimization. 20:63-75
We establish a new formalism for problems pertaining to the periodic autocorrelation function of finite sequences, which is suitable for Combinatorial Optimization methods. This allows one to bring to bear powerful Combinatorial Optimization methods
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::a8e7e6df39a2ce671b5c0eb2ad3126f0
https://doi.org/10.1007/s10878-008-9194-5
https://doi.org/10.1007/s10878-008-9194-5
Publikováno v:
Computational Optimization and Applications. 47:61-76
In this paper, a new metaheuristic for the job shop scheduling problem is proposed. Our approach uses the backbone and "big valley" properties of the job shop scheduling problem. The results of the computational experiments have demonstrated the high
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::67717f1d88d408e0a636670685ce5680
https://doi.org/10.1007/s10589-008-9206-5
https://doi.org/10.1007/s10589-008-9206-5
Publikováno v:
Operations Research Letters. 36:434-438
In this note we investigate the performance of global equilibrium search based heuristics on the weighted MAX-SAT problem. Three variants of the approach are implemented and compared with other existing algorithms on publicly available benchmark inst
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::13e13fb7c8786dee8c6258bff1550553
https://doi.org/10.1016/j.orl.2007.11.007
https://doi.org/10.1016/j.orl.2007.11.007
Publikováno v:
Optimization Methods and Software. 23:129-140
We describe a heuristic method for solving the unconstrained binary quadratic optimization problem based on a global equilibrium search framework. We investigate performance of the proposed approach and compare it with the best available solver [G. P
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::52fe23967db9e56754b5ade53e73e285
https://doi.org/10.1080/10556780701550083
https://doi.org/10.1080/10556780701550083