Tree decomposition and discrete optimization problems: A survey-Reference-Cited by-同舟云学术

Tree decomposition and discrete optimization problems: A survey

Published:2007-07 Issue:4 Volume:43 Page:549-562
ISSN:1060-0396
Container-title:Cybernetics and Systems Analysis
language:en
Short-container-title:Cybern Syst Anal

Author:

Shcherbina O. A.

Publisher

Springer Science and Business Media LLC

Subject

General Computer Science

Link

http://link.springer.com/content/pdf/10.1007/s10559-007-0080-4.pdf

Reference101 articles.

1. V. S. Mikhalevich, I. V. Sergienko, A. I. Kuksa, V. A. Roshchin, and V. A. Trubin, Results of Experimental Study of the Efficiency of Methods included into the DISPRO Software [in Russian], Prepr. AN USSR, IK, 80-47, Kyiv (1980).

2. Yu. I. Zhuravlyov, Selected Scientific Works [in Russian], Magistr, Moscow (1998).

3. O. A. Shcherbina, “Application of local algorithms to solving integer linear programming problems,” in: Problems of Cybernetics [in Russian], NSK AN SSSR, Moscow (1989), pp. 19–34.

4. O. A. Shcherbina, “Nonserial modification of a local decomposition algorithm for discrete optimization problems,” in: Dynamic Systems [in Russian], Issue 19, TNU, Simferopol (2005), pp. 179–190.

5. B. Courcelle, “The monadic second-order logic of graphs I: Recognizable sets of finite graphs,” Inform. and Comput., 85, 12–75 (1990).

Cited by 2 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. Block Local Elimination Algorithms for Sparse Discrete Optimization Problems;Cybernetics and Systems Analysis;2013-11

2. Graph-Based Local Elimination Algorithms in Discrete Optimization;Foundations of Computational Intelligence Volume 3;2009