( en | de | ru )

 

Disambiguation of "Prokopyev, Oleg A."

Author of the publication

copydeleteadd this publication to your clipboard
On exact solution approaches for bilevel quadratic 0-1 knapsack problem.

, , and . Ann. Oper. Res., 298 (1): 555-572 (2021)

Please choose a person to relate this publication to

To differ between persons with the same name, the academic degree and the title of an important publication will be displayed. You can also use the button next to the name to display some publications already assigned to the person.

Yaroslavskyy Oleg

Diego José Olego

Oleg Kashin

Oleg Kovalev

Oleg Nivievskyi

 

Other publications of authors with the same name

On maximum degree-based \(\gamma\)-quasi-clique problem: Complexity and exact approaches, , , and . Networks, 71 (2): 136--152 (2018)On Greedy and Strategic Evaders in Sequential Interdiction Settings with Incomplete Information., and . CoRR, (2018)A global optimization algorithm for solving the minimum multiple ratio spanning tree problem., , and . J. Glob. Optim., 56 (3): 1029-1043 (2013)Solving a class of feature selection problems via fractional 0-1 programming., , and . Ann. Oper. Res., 303 (1): 265-295 (2021)An approach to the distributionally robust shortest path problem., , and . Comput. Oper. Res., (2021)Sequence Independent Lifting for the Set of Submodular Maximization Problem., , and . IPCO, volume 12125 of Lecture Notes in Computer Science, page 378-390. Springer, (2020)Robustness of solutions to critical node detection problems with imperfect data: a computational study., , , and . Optim. Methods Softw., 32 (2): 250-273 (2017)Book review.. Optim. Methods Softw., 21 (6): 995-996 (2006)Lower Bound Improvement and Forcing Rule for Quadratic Binary Programming., , and . Comput. Optim. Appl., 33 (2-3): 187-208 (2006)On bilevel minimum and bottleneck spanning tree problems., , and . Networks, 74 (3): 251-273 (2019)