Abstract
Solving discrete optimization problems (DOP) can be a rather hard task. Many real DOPs contain a huge number of variables and/or constraints that make the models intractable for currently available solvers. There are few approaches for solving DOPs: tree search approaches (e.g., branch and bound), relaxation and decomposition methods. Large DOPs can be solved due to their special structure. Among decomposition approaches we can mention poorly known local decomposition algorithms using the special block matrix structure of constraints and half-forgotten nonserial dynamic programming algorithms which can exploit sparsity in the dependency graph of a DOP.
Keywords
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsPreview
Unable to display preview. Download preview PDF.
References
Arnborg S, Lagergren J, Seese D (1991) Easy problems for tree-decomposable graphs, J. of Alg. 12:308–340
Bertele U, Brioschi F (1972) Nonserial Dynamic Programming, Academic Press. New York
Bodlaender HL (1997) Treewidth: Algorithmic techniques and results. In: Privara, L. et al. (ed), Mathematical foundations of computer science 1997. Proceedings. Berlin: Springer. Lect. Notes Comput. Sci. 1295:19–36
Dechter R, El Fattah Y (2001) Topological parameters for time-space tradeoff. Articial Intelligence 125: 93–118
Hooker JN (2000) Logic-based methods for optimization: combining optimization and constraint satisfaction. John Wiley & Sons
Kloks T (1994) Treewidth: Computations and Approximations, Lecture Notes in Computer Science 842, Springer-Verlag
Nowak I (2005) Lagrangian decomposition of block-separable mixed-integer all-quadratic programs. Math. Programming, 102: 295–312.
Parter S (1961) The use of linear graphs in Gauss elimination. SIAM Review, 3:119–130
Robertson N, Seymour PD (1986) Graph minors. II. Algorithmic aspects of tree width. J.Algorithms, 7:309–322
Shcherbina OA (1983) On local algorithms of solving discrete optimization problems. Problems of Cybernetics. Moscow, 40:171–200
Shcherbina OA (1985) Local algorithms for block-tree problems of discrete programming. U.S.S.R. Comput. Math. Math. Phys. 25:114–121
Zhuravlev YuI, Finkelshtein YuYu (1965) Local algorithm for integer linear programming problems, Problems of Cybernetics 14, Moscow (in Russian).
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2007 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Shcherbina, O. (2007). Nonserial Dynamic Programming and Tree Decomposition in Discrete Optimization. In: Waldmann, KH., Stocker, U.M. (eds) Operations Research Proceedings 2006. Operations Research Proceedings, vol 2006. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-69995-8_26
Download citation
DOI: https://doi.org/10.1007/978-3-540-69995-8_26
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-69994-1
Online ISBN: 978-3-540-69995-8
eBook Packages: Business and EconomicsBusiness and Management (R0)