{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,4]],"date-time":"2024-09-04T22:29:17Z","timestamp":1725488957943},"publisher-location":"Berlin, Heidelberg","reference-count":12,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540699941"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"DOI":"10.1007\/978-3-540-69995-8_26","type":"book-chapter","created":{"date-parts":[[2007,8,10]],"date-time":"2007-08-10T16:28:21Z","timestamp":1186763301000},"page":"155-160","source":"Crossref","is-referenced-by-count":10,"title":["Nonserial Dynamic Programming and Tree Decomposition in Discrete Optimization"],"prefix":"10.1007","author":[{"given":"Oleg","family":"Shcherbina","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"26_CR1","doi-asserted-by":"publisher","first-page":"308","DOI":"10.1016\/0196-6774(91)90006-K","volume":"12","author":"S. Arnborg","year":"1991","unstructured":"Arnborg S, Lagergren J, Seese D (1991) Easy problems for tree-decomposable graphs, J. of Alg. 12:308\u2013340","journal-title":"J. of Alg."},{"key":"26_CR2","volume-title":"Nonserial Dynamic Programming","author":"U. Bertele","year":"1972","unstructured":"Bertele U, Brioschi F (1972) Nonserial Dynamic Programming, Academic Press. New York"},{"key":"26_CR3","series-title":"Lect. Notes Comput. Sci.","doi-asserted-by":"publisher","first-page":"19","DOI":"10.1007\/BFb0029946","volume-title":"Mathematical foundations of computer science 1997. Proceedings","author":"H.L. Bodlaender","year":"1997","unstructured":"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\u201336"},{"key":"26_CR4","doi-asserted-by":"publisher","first-page":"93","DOI":"10.1016\/S0004-3702(00)00050-3","volume":"125","author":"R. Dechter","year":"2001","unstructured":"Dechter R, El Fattah Y (2001) Topological parameters for time-space tradeoff. Articial Intelligence 125: 93\u2013118","journal-title":"Articial Intelligence"},{"key":"26_CR5","doi-asserted-by":"crossref","unstructured":"Hooker JN (2000) Logic-based methods for optimization: combining optimization and constraint satisfaction. John Wiley & Sons","DOI":"10.1002\/9781118033036"},{"key":"26_CR6","doi-asserted-by":"crossref","unstructured":"Kloks T (1994) Treewidth: Computations and Approximations, Lecture Notes in Computer Science 842, Springer-Verlag","DOI":"10.1007\/BFb0045375"},{"key":"26_CR7","doi-asserted-by":"publisher","first-page":"295","DOI":"10.1007\/s10107-003-0500-9","volume":"102","author":"I. Nowak","year":"2005","unstructured":"Nowak I (2005) Lagrangian decomposition of block-separable mixed-integer all-quadratic programs. Math. Programming, 102: 295\u2013312.","journal-title":"Math. Programming"},{"key":"26_CR8","doi-asserted-by":"publisher","first-page":"119","DOI":"10.1137\/1003021","volume":"3","author":"S. Parter","year":"1961","unstructured":"Parter S (1961) The use of linear graphs in Gauss elimination. SIAM Review, 3:119\u2013130","journal-title":"SIAM Review"},{"key":"26_CR9","doi-asserted-by":"publisher","first-page":"309","DOI":"10.1016\/0196-6774(86)90023-4","volume":"7","author":"N. Robertson","year":"1986","unstructured":"Robertson N, Seymour PD (1986) Graph minors. II. Algorithmic aspects of tree width. J.Algorithms, 7:309\u2013322","journal-title":"J.Algorithms"},{"key":"26_CR10","first-page":"171","volume":"40","author":"O.A. Shcherbina","year":"1983","unstructured":"Shcherbina OA (1983) On local algorithms of solving discrete optimization problems. Problems of Cybernetics. Moscow, 40:171\u2013200","journal-title":"Problems of Cybernetics. Moscow"},{"key":"26_CR11","doi-asserted-by":"publisher","first-page":"114","DOI":"10.1016\/0041-5553(85)90154-5","volume":"25","author":"O.A. Shcherbina","year":"1985","unstructured":"Shcherbina OA (1985) Local algorithms for block-tree problems of discrete programming. U.S.S.R. Comput. Math. Math. Phys. 25:114\u2013121","journal-title":"U.S.S.R. Comput. Math. Math. Phys."},{"key":"26_CR12","unstructured":"Zhuravlev YuI, Finkelshtein YuYu (1965) Local algorithm for integer linear programming problems, Problems of Cybernetics 14, Moscow (in Russian)."}],"container-title":["Operations Research Proceedings","Operations Research Proceedings 2006"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-69995-8_26.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,11,19]],"date-time":"2020-11-19T05:06:09Z","timestamp":1605762369000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-69995-8_26"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[null]]},"ISBN":["9783540699941"],"references-count":12,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-69995-8_26","relation":{},"subject":[]}}