1 citations · 2 across the 4 of their papers we have counts for
4 papers
Block local elimination algorithms for solving sparse discrete optimization problems
Alexander Sviridenko, Oleg Shcherbina
Block elimination algorithms for solving sparse discrete optimization problems are considered. The numerical example is provided. The benchmarking is done in order to define real c…
Benchmarking ordering techniques for nonserial dynamic programming
Alexander Sviridenko, Oleg Shcherbina
Five ordering algorithms for the nonserial dynamic programming algorithm for solving sparse discrete optimization problems are compared in this paper. The benchmarking reveals that…
Tree decomposition and postoptimality analysis in discrete optimization
O. Shcherbina
Many real discrete optimization problems (DOPs) are -hard and contain a huge number of variables and/or constraints that make the models intractable for currently available sol…
Graph-based local elimination algorithms in discrete optimization
Oleg Shcherbina
The aim of this paper is to provide a review of structural decomposition methods in discrete optimization and to give a unified framework in the form of local elimination algorithm…