Local elimination algorithms for solving sparse discrete problems
Žurnal vyčislitelʹnoj matematiki i matematičeskoj fiziki, Tome 48 (2008) no. 1, pp. 159-175
Voir la notice de l'article provenant de la source Math-Net.Ru
The class of local elimination algorithms is considered that make it possible to obtain global information about solutions of a problem using local information. The general structure of local elimination algorithms is described that use neighborhoods of elements and the structural graph describing the problem structure; an elimination algorithm is also described. This class of algorithms includes local decomposition algorithms for discrete optimization problems, nonserial dynamic programming algorithms, bucket elimination algorithms, and tree decomposition algorithms. It is shown that local elimination algorithms can be used for solving optimization problems.
@article{ZVMMF_2008_48_1_a11,
author = {O. A. Shcherbina},
title = {Local elimination algorithms for solving sparse discrete problems},
journal = {\v{Z}urnal vy\v{c}islitelʹnoj matematiki i matemati\v{c}eskoj fiziki},
pages = {159--175},
publisher = {mathdoc},
volume = {48},
number = {1},
year = {2008},
language = {ru},
url = {http://geodesic.mathdoc.fr/item/ZVMMF_2008_48_1_a11/}
}
TY - JOUR AU - O. A. Shcherbina TI - Local elimination algorithms for solving sparse discrete problems JO - Žurnal vyčislitelʹnoj matematiki i matematičeskoj fiziki PY - 2008 SP - 159 EP - 175 VL - 48 IS - 1 PB - mathdoc UR - http://geodesic.mathdoc.fr/item/ZVMMF_2008_48_1_a11/ LA - ru ID - ZVMMF_2008_48_1_a11 ER -
O. A. Shcherbina. Local elimination algorithms for solving sparse discrete problems. Žurnal vyčislitelʹnoj matematiki i matematičeskoj fiziki, Tome 48 (2008) no. 1, pp. 159-175. http://geodesic.mathdoc.fr/item/ZVMMF_2008_48_1_a11/