{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,2,9]],"date-time":"2025-02-09T08:10:20Z","timestamp":1739088620787,"version":"3.37.0"},"publisher-location":"Berlin, Heidelberg","reference-count":105,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642010842"},{"type":"electronic","value":"9783642010859"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2009]]},"DOI":"10.1007\/978-3-642-01085-9_8","type":"book-chapter","created":{"date-parts":[[2009,5,4]],"date-time":"2009-05-04T16:55:34Z","timestamp":1241456134000},"page":"235-266","source":"Crossref","is-referenced-by-count":2,"title":["Graph-Based Local Elimination Algorithms in Discrete Optimization"],"prefix":"10.1007","author":[{"given":"Oleg","family":"Shcherbina","sequence":"first","affiliation":[]}],"member":"297","reference":[{"key":"8_CR1","doi-asserted-by":"publisher","first-page":"886","DOI":"10.1137\/S0895479894278952","volume":"17","author":"P.R. Amestoy","year":"1996","unstructured":"Amestoy, P.R., Davis, T.A., Duff, I.S.: An approximate minimum degree ordering algorithm. SIAM J. on Matrix Analysis and Applications\u00a017, 886\u2013905 (1996)","journal-title":"SIAM J. on Matrix Analysis and Applications"},{"key":"8_CR2","unstructured":"Amir, E.: Efficient approximation for triangulation of minimum treewidth. In: Proceedings of UAI (2001)"},{"key":"8_CR3","volume-title":"The optimal design of chemical reactors","author":"R. Aris","year":"1961","unstructured":"Aris, R.: The optimal design of chemical reactors. Academic Press, New York (1961)"},{"key":"8_CR4","doi-asserted-by":"publisher","first-page":"2","DOI":"10.1007\/BF01934985","volume":"25","author":"S. Arnborg","year":"1985","unstructured":"Arnborg, S.: Efficient algorithms for combinatorial problems on graphs with bounded decomposability \u2014 A survey. BIT\u00a025, 2\u201323 (1985)","journal-title":"BIT"},{"issue":"2","key":"8_CR5","doi-asserted-by":"publisher","first-page":"277","DOI":"10.1137\/0608024","volume":"8","author":"S. Arnborg","year":"1987","unstructured":"Arnborg, S., Corneil, D.G., Proskurowski, A.: Complexity of finding embeddings in a k-tree. SIAM J. Alg. Disc. Meth.\u00a08(2), 277\u2013284 (1987)","journal-title":"SIAM J. Alg. Disc. Meth."},{"key":"8_CR6","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.: Easy problems for tree-decomposable graphs. J. of Algorithms\u00a012, 308\u2013340 (1991)","journal-title":"J. of Algorithms"},{"issue":"6","key":"8_CR7","doi-asserted-by":"publisher","first-page":"1404","DOI":"10.1137\/0916081","volume":"16","author":"C. Ashcraft","year":"1995","unstructured":"Ashcraft, C.: Compressed graphs and the minimum degree algorithm. SIAM J. Sci. Comput.\u00a016(6), 1404\u20131411 (1995)","journal-title":"SIAM J. Sci. Comput."},{"issue":"3","key":"8_CR8","doi-asserted-by":"publisher","first-page":"816","DOI":"10.1137\/S0895479896299081","volume":"19","author":"C. Ashcraft","year":"1995","unstructured":"Ashcraft, C., Liu, J.W.H.: Robust ordering of sparse matrices using multisection. SIAM J. Matrix Anal. Appl.\u00a019(3), 816\u2013832 (1995)","journal-title":"SIAM J. Matrix Anal. Appl."},{"key":"8_CR9","doi-asserted-by":"publisher","first-page":"316","DOI":"10.1287\/opre.46.3.316","volume":"46","author":"C. Barnhart","year":"1998","unstructured":"Barnhart, C., Johnson, E.L., Nemhauser, G.L., Savelsbergh, M.W.P., Vance, P.H.: Branch and price: Column generation for solving huge integer programs. Operations Research\u00a046, 316\u2013329 (1998)","journal-title":"Operations Research"},{"key":"8_CR10","doi-asserted-by":"publisher","first-page":"479","DOI":"10.1145\/2402.322389","volume":"30","author":"C. Beeri","year":"1983","unstructured":"Beeri, C., Fagin, R., Maier, D., Yannakakis, M.: On the desirability of acyclic database schemes. Journal ACM\u00a030, 479\u2013513 (1983)","journal-title":"Journal ACM"},{"key":"8_CR11","doi-asserted-by":"publisher","first-page":"65","DOI":"10.1016\/0022-247X(65)90054-5","volume":"12","author":"C.S. Beightler","year":"1965","unstructured":"Beightler, C.S., Johnson, D.B.: Superposition in branching allocation problems. Journal of Mathematical Analysis and Applications\u00a012, 65\u201370 (1965)","journal-title":"Journal of Mathematical Analysis and Applications"},{"key":"8_CR12","doi-asserted-by":"crossref","DOI":"10.1515\/9781400874651","volume-title":"Applied Dynamic Programming","author":"R. Bellman","year":"1962","unstructured":"Bellman, R., Dreyfus, S.: Applied Dynamic Programming. Princeton University Press, Princeton (1962)"},{"key":"8_CR13","doi-asserted-by":"publisher","first-page":"238","DOI":"10.1007\/BF01386316","volume":"4","author":"J.F. Benders","year":"1962","unstructured":"Benders, J.F.: Partitioning procedures for solving mixed-variables programming problems. Numerische Mathematik\u00a04, 238\u2013252 (1962)","journal-title":"Numerische Mathematik"},{"key":"8_CR14","doi-asserted-by":"publisher","first-page":"565","DOI":"10.1016\/0022-247X(69)90137-1","volume":"27","author":"U. Bertele","year":"1969","unstructured":"Bertele, U., Brioschi, F.: A new algorithm for the solution of the secondary optimization problem in nonserial dynamic programming. Journal of Mathematical Analysis and Applications\u00a027, 565\u2013574 (1969)","journal-title":"Journal of Mathematical Analysis and Applications"},{"key":"8_CR15","doi-asserted-by":"publisher","first-page":"313","DOI":"10.1016\/0022-247X(69)90030-4","volume":"28","author":"U. Bertele","year":"1969","unstructured":"Bertele, U., Brioschi, F.: Contribution to nonserial dynamic programming. Journal of Mathematical Analysis and Applications\u00a028, 313\u2013325 (1969)","journal-title":"Journal of Mathematical Analysis and Applications"},{"key":"8_CR16","volume-title":"Nonserial Dynamic Programming","author":"U. Bertele","year":"1972","unstructured":"Bertele, U., Brioschi, F.: Nonserial Dynamic Programming. Academic Press, New York (1972)"},{"key":"8_CR17","unstructured":"Berry, A.: A wide-range efficient algorithm for minimal triangulation. In: Proceedings of SODA (1999)"},{"key":"8_CR18","volume-title":"Graph theory and sparse matrix computation","author":"J.R.S. Blair","year":"1993","unstructured":"Blair, J.R.S., Peyton, B.: An introduction to chordal graphs and clique trees. In: Graph theory and sparse matrix computation. Springer, New York (1993)"},{"key":"8_CR19","series-title":"Lecture Notes in Computer Science","volume-title":"Graph-Theoretic Concepts in Computer Science","year":"2003","unstructured":"Bodlaender, H.L. (ed.): WG 2003. LNCS, vol.\u00a02880. Springer, Heidelberg (2003)"},{"key":"8_CR20","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","DOI":"10.1007\/BFb0029946","volume-title":"Mathematical Foundations of Computer Science 1997","author":"H.L. Bodlaender","year":"1997","unstructured":"Bodlaender, H.L.: Treewidth: Algorithmic techniques and results. In: Privara, I., Ru\u017ei\u010dka, P. (eds.) MFCS 1997. LNCS, vol.\u00a01295. Springer, Heidelberg (1997)"},{"key":"8_CR21","doi-asserted-by":"publisher","first-page":"255","DOI":"10.1093\/comjnl\/bxm037","volume":"51","author":"H. Bodlaender","year":"2008","unstructured":"Bodlaender, H., Koster, A.M.C.A.: Combinatorial optimization on graphs of bounded treewidth. Computer Journal\u00a051, 255\u2013269 (2008)","journal-title":"Computer Journal"},{"key":"8_CR22","doi-asserted-by":"crossref","unstructured":"Burkard, R.E., Hamacher, H.W., Tind, J.: On General Decomposition Schemes in Mathematical Programming. Mathematical Programming Studies 24: Festschrift on the occasion of the 70 th birthday of George B. Dantzig, 238\u2013252 (1985)","DOI":"10.1007\/BFb0121054"},{"key":"8_CR23","doi-asserted-by":"crossref","unstructured":"Cook, S.A.: The complexity of theorem-proving procedures. In: Proc. 3rd Ann. ACM Symp. on Theory of Computing Machinery, New York (1971)","DOI":"10.1145\/800157.805047"},{"key":"8_CR24","doi-asserted-by":"publisher","first-page":"233","DOI":"10.1287\/ijoc.15.3.233.16078","volume":"15","author":"W. Cook","year":"2003","unstructured":"Cook, W., Seymour, P.D.: Tour merging via branch-decomposition. INFORMS Journal on Computing\u00a015, 233\u2013248 (2003)","journal-title":"INFORMS Journal on Computing"},{"key":"8_CR25","doi-asserted-by":"publisher","first-page":"12","DOI":"10.1016\/0890-5401(90)90043-H","volume":"85","author":"B. Courcelle","year":"1990","unstructured":"Courcelle, B.: The monadic second-order logic of graphs I: Recognizable sets of finite graphs. Information and Computation\u00a085, 12\u201375 (1990)","journal-title":"Information and Computation"},{"key":"8_CR26","doi-asserted-by":"publisher","first-page":"171","DOI":"10.1016\/0166-218X(90)90142-Y","volume":"29","author":"Y. Crama","year":"1990","unstructured":"Crama, Y., Hansen, P., Jaumard, B.: The basic algorithm for pseudo-boolean programming revisited. Discrete Applied Mathematics\u00a029, 171\u2013185 (1990)","journal-title":"Discrete Applied Mathematics"},{"key":"8_CR27","doi-asserted-by":"publisher","first-page":"200","DOI":"10.2307\/1905523","volume":"17","author":"G.B. Dantzig","year":"1949","unstructured":"Dantzig, G.B.: Programming of interdependent activities II: Mathematical model. Econometrica\u00a017, 200\u2013211 (1949)","journal-title":"Econometrica"},{"key":"8_CR28","unstructured":"Dantzig, G.B.: Time-staged methods in linear programming. Comments and early history. In: Dantzig, G.B., et al. (eds.) Large-Scale Linear Programming, IIASA, Laxenburg, Austria, pp. 3\u201316 (1981)"},{"key":"8_CR29","unstructured":"Dantzig, G.B.: Solving staircase linear programs by a nested block-angular method. Technical Report 73-1. Stanford Univ., Dept. of Operations Research, Stanford (1973)"},{"key":"8_CR30","volume-title":"Algorithms","author":"S. Dasgupta","year":"2006","unstructured":"Dasgupta, S., Papadimitriou, C.H., Vazirani, U.V.: Algorithms. McGraw-Hill, New York (2006)"},{"key":"8_CR31","volume-title":"Encyclopedia of Artificial Intelligence","author":"R. Dechter","year":"1992","unstructured":"Dechter, R.: Constraint networks. In: Encyclopedia of Artificial Intelligence, 2nd edn. Wiley, New York (1992)","edition":"2"},{"key":"8_CR32","doi-asserted-by":"publisher","first-page":"41","DOI":"10.1016\/S0004-3702(99)00059-4","volume":"113","author":"R. Dechter","year":"1999","unstructured":"Dechter, R.: Bucket elimination: A unifying framework for reasoning. Artificial Intelligence\u00a0113, 41\u201385 (1999)","journal-title":"Artificial Intelligence"},{"key":"8_CR33","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.: Topological parameters for time-space tradeoff. Artificial Intelligence\u00a0125, 93\u2013118 (2001)","journal-title":"Artificial Intelligence"},{"key":"8_CR34","volume-title":"Constraint processing","author":"R. Dechter","year":"2003","unstructured":"Dechter, R.: Constraint processing. Morgan Kaufmann, San Francisco (2003)"},{"key":"8_CR35","doi-asserted-by":"publisher","first-page":"353","DOI":"10.1016\/0004-3702(89)90037-4","volume":"38","author":"R. Dechter","year":"1989","unstructured":"Dechter, R., Pearl, J.: Tree clustering for constraint networks. Artificial Intelligence\u00a038, 353\u2013366 (1989)","journal-title":"Artificial Intelligence"},{"key":"8_CR36","doi-asserted-by":"crossref","unstructured":"Dolgui, A., Soldek, J., Zaikin, O. (eds.): Supply chain optimisation: product\/process design, facilities location and flow control. Series: Applied Optimization, vol.\u00a094, XVI. Springer, Heidelberg (2005)","DOI":"10.1007\/b101812"},{"key":"8_CR37","doi-asserted-by":"publisher","first-page":"253","DOI":"10.1057\/jors.1974.43","volume":"25","author":"A.O. Esogbue","year":"1974","unstructured":"Esogbue, A.O., Marks, B.: Non-serial dynamic programming \u2013 A survey. Operational Research Quarterly\u00a025, 253\u2013265 (1974)","journal-title":"Operational Research Quarterly"},{"key":"8_CR38","doi-asserted-by":"publisher","first-page":"323","DOI":"10.1016\/0020-0190(88)90221-9","volume":"27","author":"D. Fernandez-Baca","year":"1988","unstructured":"Fernandez-Baca, D.: Nonserial dynamic programming formulations of satisfiability. Information Processing Letters\u00a027, 323\u2013326 (1988)","journal-title":"Information Processing Letters"},{"key":"8_CR39","first-page":"262","volume":"1","author":"F. YuYu","year":"1965","unstructured":"YuYu, F.: On solving discrete programming problems of special form. Economics and Mathematical Methods\u00a01, 262\u2013270 (1965) (Russian)","journal-title":"Economics and Mathematical Methods"},{"key":"8_CR40","doi-asserted-by":"crossref","DOI":"10.1093\/oso\/9780195100563.001.0001","volume-title":"Nonlinear and mixed-integer optimization: fundamentals and applications","author":"C.A. Floudas","year":"1995","unstructured":"Floudas, C.A.: Nonlinear and mixed-integer optimization: fundamentals and applications. Oxford University Press, Oxford (1995)"},{"key":"8_CR41","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"568","DOI":"10.1007\/978-3-540-27836-8_49","volume-title":"Automata, Languages and Programming","author":"F. Fomin","year":"2004","unstructured":"Fomin, F., Kratsch, D., Todinca, I.: Exact (exponential) algorithms for treewidth and minimum fill-in. In: D\u00edaz, J., Karhum\u00e4ki, J., Lepist\u00f6, A., Sannella, D. (eds.) ICALP 2004. LNCS, vol.\u00a03142, pp. 568\u2013580. Springer, Heidelberg (2004)"},{"issue":"1","key":"8_CR42","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1137\/1026001","volume":"26","author":"R. Fourer","year":"1984","unstructured":"Fourer, R.: Staircase matrices and systems. SIAM Review\u00a026(1), 1\u201370 (1984)","journal-title":"SIAM Review"},{"key":"8_CR43","unstructured":"Freuder, E.: Constraint solving techniques. In: Tyngu, E., Mayoh, B., Penjaen, J. (eds.) Constraint Programming of series F: Computer and System Sciences. NATO ASI Series, pp. 51\u201374 (1992)"},{"key":"8_CR44","doi-asserted-by":"crossref","first-page":"835","DOI":"10.2140\/pjm.1965.15.835","volume":"15","author":"D.R. Fulkerson","year":"1965","unstructured":"Fulkerson, D.R., Gross, O.A.: Incidence matrices and interval graphs. Pacific J. of Mathematics\u00a015, 835\u2013855 (1965)","journal-title":"Pacific J. of Mathematics"},{"key":"8_CR45","volume-title":"Computer Solution of Large Sparse Positive Definite Systems","author":"J.A. George","year":"1981","unstructured":"George, J.A., Liu, J.W.H.: Computer Solution of Large Sparse Positive Definite Systems. Prentice-Hall Inc., Englewood Cliffs (1981)"},{"key":"8_CR46","unstructured":"Gogate, V., Dechter, R.: A complete anytime algorithm for treewidth. In: Proceedings of UAI (2004)"},{"key":"8_CR47","doi-asserted-by":"publisher","first-page":"243","DOI":"10.1016\/S0004-3702(00)00078-3","volume":"124","author":"G. Gottlob","year":"2000","unstructured":"Gottlob, G., Leone, N., Scarcello, F.: A comparison of structural CSP decomposition methods. Artificial Intelligence\u00a0124, 243\u2013282 (2000)","journal-title":"Artificial Intelligence"},{"key":"8_CR48","doi-asserted-by":"publisher","first-page":"303","DOI":"10.1093\/comjnl\/bxm056","volume":"51","author":"G. Gottlob","year":"2008","unstructured":"Gottlob, G., Szeider, S.: Fixed-parameter algorithms for artificial intelligence, constraint satisfaction and database problems. The Computer Journal\u00a051, 303\u2013325 (2008)","journal-title":"The Computer Journal"},{"key":"8_CR49","doi-asserted-by":"publisher","first-page":"57","DOI":"10.1016\/0004-3702(94)90003-5","volume":"66","author":"M. Gyssens","year":"1994","unstructured":"Gyssens, M., Jeavons, P.G., Cohen, D.A.: Decomposing constraint satisfaction problems using database techniques. Artificial Intelligence\u00a066, 57\u201389 (1994)","journal-title":"Artificial Intelligence"},{"key":"8_CR50","doi-asserted-by":"crossref","unstructured":"Gu, J., Purdom, P.W., Franco, J., Wah, B.W.: Algorithms for the satisfiability (SAT) problem: A survey. Satisfiability Problem Theory and Applications (1997)","DOI":"10.1090\/dimacs\/035\/02"},{"key":"8_CR51","volume-title":"Structural Models: An Introduction to the Theory of Directed Graphs","author":"F. Harary","year":"1965","unstructured":"Harary, F., Norman, R.Z., Cartwright, D.: Structural Models: An Introduction to the Theory of Directed Graphs. John Wiley & Sons, Chichester (1965)"},{"key":"8_CR52","doi-asserted-by":"crossref","DOI":"10.1007\/978-3-642-85823-9","volume-title":"Boolean Methods in Operations Research and Related Areas","author":"P.L. Hammer","year":"1968","unstructured":"Hammer, P.L., Rudeanu, S.: Boolean Methods in Operations Research and Related Areas. Springer, Heidelberg (1968)"},{"key":"8_CR53","doi-asserted-by":"crossref","unstructured":"Heggernes, P., Eisenstat, S.C., Kumfert, G., Pothen, A.: The Computational Complexity of the Minimum Degree Algorithm. Techn. report UCRL-ID-148375. Lawrence Livermore National Laboratory (2001), http:\/\/www.llnl.gov\/tid\/lof\/documents\/pdf\/241278.pdf","DOI":"10.2172\/15002765"},{"issue":"2","key":"8_CR54","doi-asserted-by":"publisher","first-page":"468","DOI":"10.1137\/S1064827596300656","volume":"20","author":"B. Hendrickson","year":"1998","unstructured":"Hendrickson, B., Rothberg, E.: Improving the run time and quality of nested dissection ordering. SIAM J. Sci. Comput.\u00a020(2), 468\u2013489 (1998)","journal-title":"SIAM J. Sci. Comput."},{"key":"8_CR55","doi-asserted-by":"crossref","unstructured":"Hicks, I.V., Koster, A.M.C.A., Kolotoglu, E.: Branch and tree decomposition techniques for discrete optimization. In: Tutorials in Operations Research. INFORMS, New Orleans (2005), http:\/\/ie.tamu.edu\/People\/faculty\/Hicks\/bwtw.pdf","DOI":"10.1287\/educ.1053.0017"},{"key":"8_CR56","doi-asserted-by":"publisher","first-page":"326","DOI":"10.1093\/comjnl\/bxm052","volume":"51","author":"P. Hlin\u011bn\u00fd","year":"2008","unstructured":"Hlin\u011bn\u00fd, P., Oum, S., Seese, D., Gottlob, G.: Width parameters beyond tree-width and their applications. The Computer Journal\u00a051, 326\u2013362 (2008)","journal-title":"The Computer Journal"},{"key":"8_CR57","doi-asserted-by":"publisher","first-page":"245","DOI":"10.1007\/BF01589349","volume":"20","author":"J.K. Ho","year":"1981","unstructured":"Ho, J.K., Loute, E.: A set of staircase linear programming test problems. Mathematical Programming\u00a020, 245\u2013250 (1981)","journal-title":"Mathematical Programming"},{"key":"8_CR58","doi-asserted-by":"crossref","DOI":"10.1002\/9781118033036","volume-title":"Logic-based Methods for Optimization: Combining Optimization and Constraint Satisfaction","author":"J.N. Hooker","year":"2000","unstructured":"Hooker, J.N.: Logic-based Methods for Optimization: Combining Optimization and Constraint Satisfaction. John Wiley & Sons, Chichester (2000)"},{"key":"8_CR59","doi-asserted-by":"publisher","first-page":"295","DOI":"10.1287\/ijoc.14.4.295.2828","volume":"14","author":"J.N. Hooker","year":"2002","unstructured":"Hooker, J.N.: Logic, optimization and constraint programming. INFORMS Journal on Computing\u00a014, 295\u2013321 (2002)","journal-title":"INFORMS Journal on Computing"},{"key":"8_CR60","doi-asserted-by":"publisher","first-page":"57","DOI":"10.1016\/0004-3702(94)90003-5","volume":"66","author":"P.G. Jeavons","year":"1994","unstructured":"Jeavons, P.G., Gyssens, M., Cohen, D.A.: Decomposing constraint satisfaction problems using database techniques. Artificial Intelligence\u00a066, 57\u201389 (1994)","journal-title":"Artificial Intelligence"},{"key":"8_CR61","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"777","DOI":"10.1007\/11564751_63","volume-title":"Principles and Practice of Constraint Programming - CP 2005","author":"P. J\u00e9gou","year":"2005","unstructured":"J\u00e9gou, P., Ndiaye, S.N., Terrioux, C.: Computing and exploiting tree-decompositions for (Max-)CSP. In: van Beek, P. (ed.) CP 2005. LNCS, vol.\u00a03709, pp. 777\u2013781. Springer, Heidelberg (2005)"},{"key":"8_CR62","first-page":"269","volume":"4","author":"F.V. Jensen","year":"1990","unstructured":"Jensen, F.V., Lauritzen, S.L., Olesen, K.G.: Bayesian updating in causal probabilistic networks by local computations. Computat. Statist. Quart.\u00a04, 269\u2013282 (1990)","journal-title":"Computat. Statist. Quart."},{"key":"8_CR63","doi-asserted-by":"publisher","first-page":"165","DOI":"10.1016\/j.artint.2005.04.004","volume":"160","author":"K. Kask","year":"2005","unstructured":"Kask, K., Dechter, R., Larrosa, J., Dechter, A.: Unifying cluster-tree decompositions for reasoning in graphical models. Artificial Intelligence\u00a0160, 165\u2013193 (2005)","journal-title":"Artificial Intelligence"},{"key":"8_CR64","unstructured":"Kjaerulff, U.: Triangulation of graphs \u2013 algorithms giving small total state space. Techn.report. Aalborg, Denmark (1990)"},{"key":"8_CR65","doi-asserted-by":"crossref","unstructured":"Koster, A.M.C.A., van Hoesel, C.P.M., Kolen, A.W.J.: Solving frequency assignment problems via tree-decomposition. In: Broersma, H.J., et al. (eds.) 6th Twente workshop on graphs and combinatorial optimization. Univ. of Twente, Enschede, Netherlands (1999)","DOI":"10.1016\/S1571-0653(05)80034-4"},{"key":"8_CR66","doi-asserted-by":"crossref","first-page":"157","DOI":"10.1111\/j.2517-6161.1988.tb01721.x","volume":"50","author":"S.L. Lauritzen","year":"1988","unstructured":"Lauritzen, S.L., Spiegelhalter, D.J.: Local computation with probabilities on graphical structures and their application to expert systems. J. Roy. Statist. Soc. Ser. B\u00a050, 157\u2013224 (1988)","journal-title":"J. Roy. Statist. Soc. Ser. B"},{"key":"8_CR67","doi-asserted-by":"publisher","first-page":"134","DOI":"10.1137\/0611010","volume":"11","author":"J.W.H. Liu","year":"1990","unstructured":"Liu, J.W.H.: The role of elimination trees in sparse factorization. SIAM Journal on Matrix Analysis and Applications\u00a011, 134\u2013172 (1990)","journal-title":"SIAM Journal on Matrix Analysis and Applications"},{"key":"8_CR68","doi-asserted-by":"publisher","first-page":"226","DOI":"10.1016\/0022-247X(72)90046-7","volume":"40","author":"A. Martelli","year":"1972","unstructured":"Martelli, A., Montanari, U.: Nonserial Dynamic Programming: On the Optimal Strategy of Variable Elimination for the Rectangular Lattice. Journal of Mathematical Analysis and Applications\u00a040, 226\u2013242 (1972)","journal-title":"Journal of Mathematical Analysis and Applications"},{"key":"8_CR69","first-page":"52","volume":"54","author":"L.G. Mitten","year":"1963","unstructured":"Mitten, L.G., Nemhauser, G.L.: Multistage optimization. Chemical Engineering Progress\u00a054, 52\u201360 (1963)","journal-title":"Chemical Engineering Progress"},{"key":"8_CR70","unstructured":"Karypis, G., Kumar, V.: MeTiS - a software package for partitioning unstructured graphs, partitioning meshes, and computing fill-reducing orderings of sparse matrices. Version 4, University of Minnesota (1998), http:\/\/www-users.cs.umn.edu\/~karypis\/metis"},{"key":"8_CR71","first-page":"52","volume":"54","author":"L.G. Mitten","year":"1963","unstructured":"Mitten, L.G., Nemhauser, G.L.: Multistage optimization. Chemical Engineering Progress\u00a054, 52\u201360 (1963)","journal-title":"Chemical Engineering Progress"},{"key":"8_CR72","volume-title":"Probabilistic Reasoning in Expert Systems","author":"R.E. Neapolitan","year":"1990","unstructured":"Neapolitan, R.E.: Probabilistic Reasoning in Expert Systems. Wiley, New York (1990)"},{"key":"8_CR73","doi-asserted-by":"crossref","DOI":"10.1002\/9781118627372","volume-title":"Integer and Combinatorial Optimization","author":"G.L. Nemhauser","year":"1988","unstructured":"Nemhauser, G.L., Wolsey, L.A.: Integer and Combinatorial Optimization. John Wiley & Sons, Chichester (1988)"},{"key":"8_CR74","doi-asserted-by":"publisher","first-page":"5","DOI":"10.1287\/opre.42.1.5","volume":"42","author":"G.L. Nemhauser","year":"1994","unstructured":"Nemhauser, G.L.: The age of optimization: solving large-scale real-world problems. Operations Research\u00a042, 5\u201313 (1994)","journal-title":"Operations Research"},{"key":"8_CR75","doi-asserted-by":"publisher","first-page":"295","DOI":"10.1007\/s10107-003-0500-9","volume":"102","author":"I. Nowak","year":"2005","unstructured":"Nowak, I.: Lagrangian decomposition of block-separable mixed-integer all-quadratic programs. Mathematical Programming\u00a0102, 295\u2013312 (2005)","journal-title":"Mathematical Programming"},{"key":"8_CR76","unstructured":"Neumaier, A., Shcherbina, O.: Nonserial dynamic programming and local decomposition algorithms in discrete programming (submitted, 2008), http:\/\/www.optimization-online.org\/DB_HTML\/2006\/03\/1351.html"},{"key":"8_CR77","unstructured":"Pang, W., Goodwin, S.D.: A new synthesis algorithm for solving CSPs. In: Proc. of the 2nd Int. Workshop on Constraint-Based Reasoning. Key West (1996)"},{"volume-title":"Handbook of combinatorial optimization","year":"1998","key":"8_CR78","unstructured":"Pardalos, P.M., Du, D.Z. (eds.): Handbook of combinatorial optimization, vol.\u00a01, 2, and 3. Kluwer Academic Publishers, Dordrecht (1998)"},{"volume-title":"Novel approaches to hard discrete optimization","year":"2003","key":"8_CR79","unstructured":"Pardalos, P.M., Wolkowicz, H. (eds.): Novel approaches to hard discrete optimization. Fields Institute, American Mathematical Society (2003)"},{"key":"8_CR80","doi-asserted-by":"publisher","first-page":"119","DOI":"10.1137\/1003021","volume":"3","author":"S. Parter","year":"1961","unstructured":"Parter, S.: The use of linear graphs in Gauss elimination. SIAM Review\u00a03, 119\u2013130 (1961)","journal-title":"SIAM Review"},{"key":"8_CR81","volume-title":"Probabilistic reasoning in intelligent systems","author":"J. Pearl","year":"1988","unstructured":"Pearl, J.: Probabilistic reasoning in intelligent systems. Morgan Kaufmann, San Mateo (1988)"},{"key":"8_CR82","doi-asserted-by":"crossref","unstructured":"Ralphs, T.K., Galati, M.V.: Decomposition in integer linear programming. In: Karlof, J. (ed.) Integer Programming: Theory and Practice (2005)","DOI":"10.1201\/9781420039597.ch10"},{"key":"8_CR83","first-page":"309","volume":"7","author":"N. Robertson","year":"1986","unstructured":"Robertson, N., Seymour, P.D.: Graph minors. II. Algorithmic aspects of tree width. J. of Algorithms\u00a07, 309\u2013322 (1986)","journal-title":"Algorithmic aspects of tree width. J. of Algorithms"},{"key":"8_CR84","doi-asserted-by":"publisher","first-page":"266","DOI":"10.1137\/0205021","volume":"5","author":"D. Rose","year":"1976","unstructured":"Rose, D., Tarjan, R., Lueker, G.: Algorithmic aspects of vertex elimination on graphs. SIAM J. on Computing\u00a05, 266\u2013283 (1976)","journal-title":"SIAM J. on Computing"},{"key":"8_CR85","doi-asserted-by":"crossref","first-page":"183","DOI":"10.1016\/B978-1-4832-3187-7.50018-0","volume-title":"Graph Theory and Computing","author":"D.J. Rose","year":"1972","unstructured":"Rose, D.J.: A graph-theoretic study of the numerical solution of sparse positive definite systems of linear equations. In: Read, R.C. (ed.) Graph Theory and Computing, pp. 183\u2013217. Academic Press, New York (1972)"},{"key":"8_CR86","doi-asserted-by":"publisher","first-page":"47","DOI":"10.1137\/0211004","volume":"11","author":"A. Rosenthal","year":"1982","unstructured":"Rosenthal, A.: Dynamic programming is optimal for nonserial optimization problems. SIAM J. Comput.\u00a011, 47\u201359 (1982)","journal-title":"SIAM J. Comput."},{"key":"8_CR87","unstructured":"Seidel, P.: A new method for solving constraint satisfaction problems. In: Proc. of the 7th IJCAI, Vancouver, Canada, pp. 338\u2013342 (1981)"},{"key":"8_CR88","unstructured":"Sergienko, I.V., Shylo, V.P.: Discrete Optimization: Problems, Methods, Studies, Naukova Dumka, Kiev (2003)"},{"key":"8_CR89","doi-asserted-by":"publisher","first-page":"276","DOI":"10.1016\/0041-5553(80)90331-6","volume":"20","author":"O. Shcherbina","year":"1980","unstructured":"Shcherbina, O.: A local algorithm for integer optimization problems. USSR Comput. Math. Phys.\u00a020, 276\u2013279 (1980)","journal-title":"USSR Comput. Math. Phys."},{"key":"8_CR90","first-page":"171","volume":"40","author":"O.A. Shcherbina","year":"1983","unstructured":"Shcherbina, O.A.: On local algorithms of solving discrete optimization problems. Problems of Cybernetics (Moscow)\u00a040, 171\u2013200 (1983)","journal-title":"Problems of Cybernetics (Moscow)"},{"key":"8_CR91","first-page":"155","volume-title":"Proc. of Int. Conference on Operations Research Operations Research 2006","author":"O. Shcherbina","year":"2006","unstructured":"Shcherbina, O.: Nonserial dynamic programming and tree decomposition in discrete optimization. In: Proc. of Int. Conference on Operations Research Operations Research 2006, Karlsruhe, September 6-8, pp. 155\u2013160. Springer, Berlin (2006)"},{"key":"8_CR92","doi-asserted-by":"publisher","first-page":"549","DOI":"10.1007\/s10559-007-0080-4","volume":"43","author":"O.A. Shcherbina","year":"2007","unstructured":"Shcherbina, O.A.: Tree decomposition and discrete optimization problems: A survey. Cybernetics and Systems Analysis\u00a043, 549\u2013562 (2007)","journal-title":"Cybernetics and Systems Analysis"},{"key":"8_CR93","first-page":"21","volume":"22","author":"O.A. Shcherbina","year":"2007","unstructured":"Shcherbina, O.A.: Methodological issues of dynamic programming. Dynamich Sistemy\u00a022, 21\u201336 (2007) (in Russian)","journal-title":"Dynamich Sistemy"},{"key":"8_CR94","doi-asserted-by":"crossref","first-page":"152","DOI":"10.1134\/S0965542508010120","volume":"48","author":"O.A. Shcherbina","year":"2008","unstructured":"Shcherbina, O.A.: Local elimination algorithms for solving sparse discrete problems. Comput. Math. and Math. Phys.\u00a048, 152\u2013167 (2008)","journal-title":"Comput. Math. and Math. Phys."},{"key":"8_CR95","doi-asserted-by":"publisher","first-page":"43","DOI":"10.1109\/MEX.1986.4306979","volume":"1","author":"P.P. Shenoy","year":"1986","unstructured":"Shenoy, P.P., Shafer, G.: Propagating belief functions using local computations. IEEE Expert\u00a01, 43\u201352 (1986)","journal-title":"IEEE Expert"},{"key":"8_CR96","unstructured":"Shoikhet, K., Geiger, D.: A practical algorithm for finding optimal triangulation. In: Proceedings of AAAI (1997)"},{"key":"8_CR97","doi-asserted-by":"publisher","first-page":"395","DOI":"10.1016\/j.jda.2006.05.004","volume":"5","author":"J. Urrutia","year":"2007","unstructured":"Urrutia, J.: Local solutions for global problems in wireless networks. J. of Discrete Algorithms\u00a05, 395\u2013407 (2007)","journal-title":"J. of Discrete Algorithms"},{"key":"8_CR98","doi-asserted-by":"publisher","first-page":"296","DOI":"10.1016\/j.orl.2005.05.009","volume":"34","author":"F. Vanderbeck","year":"2006","unstructured":"Vanderbeck, F., Savelsbergh, M.: A generic view at the Dantzig-Wolfe decomposition approach in mixed integer programming. Operations Research Letters\u00a034, 296\u2013306 (2006)","journal-title":"Operations Research Letters"},{"key":"8_CR99","doi-asserted-by":"publisher","first-page":"46","DOI":"10.1007\/BF02591718","volume":"25","author":"T.J. Roy Van","year":"1983","unstructured":"Van Roy, T.J.: Cross decomposition for mixed integer programming. Mathematical Programming\u00a025, 46\u201363 (1983)","journal-title":"Mathematical Programming"},{"key":"8_CR100","doi-asserted-by":"publisher","first-page":"119","DOI":"10.1007\/BF01602094","volume":"7","author":"B.W. Wah","year":"1988","unstructured":"Wah, B.W., Li, G.-J.: Systolic processing for dynamic programming problems. Circuits Systems Signal Process\u00a07, 119\u2013149 (1988)","journal-title":"Circuits Systems Signal Process"},{"key":"8_CR101","volume-title":"Foundations of Optimization","author":"D. Wilde","year":"1967","unstructured":"Wilde, D., Beightler, C.: Foundations of Optimization. Prentice-Hall, Englewood Cliffs (1967)"},{"key":"8_CR102","doi-asserted-by":"publisher","first-page":"257","DOI":"10.1016\/S0004-3702(99)00077-6","volume":"115","author":"R. Weigel","year":"1999","unstructured":"Weigel, R., Faltings, B.: Compiling constraint satisfaction problems. Artificial Intelligence\u00a0115, 257\u2013287 (1999)","journal-title":"Artificial Intelligence"},{"key":"8_CR103","doi-asserted-by":"publisher","first-page":"89","DOI":"10.1137\/0114008","volume":"14","author":"R.J.B. Wets","year":"1966","unstructured":"Wets, R.J.B.: Programming under uncertainty: The equivalent convex program. SIAM J. Appl. Math.\u00a014, 89\u2013105 (1966)","journal-title":"SIAM J. Appl. Math."},{"key":"8_CR104","unstructured":"YuI, Z.: Selected Works. Magistr, Moscow (1998) (in Russian)"},{"key":"8_CR105","doi-asserted-by":"publisher","first-page":"183","DOI":"10.1007\/BF02366917","volume":"31","author":"Z. YuI","year":"1995","unstructured":"YuI, Z., Losev, G.: Neighborhoods in problems of discrete mathematics. Cybern. Syst. Anal.\u00a031, 183\u2013189 (1995)","journal-title":"Cybern. Syst. Anal."}],"container-title":["Studies in Computational Intelligence","Foundations of Computational Intelligence Volume 3"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-01085-9_8.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,2,9]],"date-time":"2025-02-09T07:45:46Z","timestamp":1739087146000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-01085-9_8"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2009]]},"ISBN":["9783642010842","9783642010859"],"references-count":105,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-01085-9_8","relation":{},"ISSN":["1860-949X","1860-9503"],"issn-type":[{"type":"print","value":"1860-949X"},{"type":"electronic","value":"1860-9503"}],"subject":[],"published":{"date-parts":[[2009]]}}}