1 citations · 1 across the 2 of their papers we have counts for
2 papers
cs.DM2009
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…
cs.DM2009★ 1 cited
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…