Skip header Section
Skip Bibliometrics Section
Nonserial Dynamic ProgrammingJanuary 1972
- Authors:
- Umberto Bertele,
- Francesco Brioschi
Abstract
No abstract available.
Cited By
- Wang Y, Mary A, Sagot M and Sinaimeri B (2023). A General Framework for Enumerating Equivalence Classes of Solutions, Algorithmica, 85:10, (3003-3023), Online publication date: 1-Oct-2023.
- Dabrowski K, Jonsson P, Ordyniak S and Osipov G (2023). Solving infinite-domain CSPs using the patchwork property, Artificial Intelligence, 317:C, Online publication date: 1-Apr-2023.
- Bodlaender H, van Dobben de Bruyn J, Gijswijt D and Smit H (2022). Constructing tree decompositions of graphs with bounded gonality, Journal of Combinatorial Optimization, 44:4, (2681-2699), Online publication date: 1-Nov-2022.
- Hooker J Stochastic Decision Diagrams Integration of Constraint Programming, Artificial Intelligence, and Operations Research, (138-154)
- Mescoff G, Paul C and Thilikos D (2022). A polynomial time algorithm to compute the connected treewidth of a series–parallel graph, Discrete Applied Mathematics, 312:C, (72-85), Online publication date: 15-May-2022.
- Liu K and Lu M (2021). Complete-Subgraph-Transversal-Sets problem on bounded treewidth graphs, Journal of Combinatorial Optimization, 41:4, (923-933), Online publication date: 1-May-2021.
- Fichte J, Hecher M and Kieler M Treewidth-Aware Quantifier Elimination and Expansion for QCSP Principles and Practice of Constraint Programming, (248-266)
- Bodlaender H, van Dobben de Bruyn J, Gijswijt D and Smit H Constructing Tree Decompositions of Graphs with Bounded Gonality Computing and Combinatorics, (384-396)
- Eppstein D and Havvaei E (2020). Parameterized Leaf Power Recognition via Embedding into Graph Products, Algorithmica, 82:8, (2337-2359), Online publication date: 1-Aug-2020.
- Kangas K, Koivisto M and Salonen S (2019). A Faster Tree-Decomposition Based Algorithm for Counting Linear Extensions, Algorithmica, 82:8, (2156-2173), Online publication date: 1-Aug-2020.
- Tziavelis N, Ajwani D, Gatterbauer W, Riedewald M and Yang X (2020). Optimal algorithms for ranked enumeration of answers to full conjunctive queries, Proceedings of the VLDB Endowment, 13:9, (1582-1597), Online publication date: 1-May-2020.
Korhonen T, Berg J and Järvisalo M (2019). Solving Graph Problems via Potential Maximal Cliques, ACM Journal of Experimental Algorithmics, 24, (1-19), Online publication date: 17-Dec-2019.- Campos V, Lopes R, Maia A and Sau I (2019). Adapting The Directed Grid Theorem into an FPT Algorithm, Electronic Notes in Theoretical Computer Science (ENTCS), 346:C, (229-240), Online publication date: 30-Aug-2019.
- Hirai H, Iwamasa Y, Murota K and Živný S (2019). A Tractable Class of Binary VCSPs via M-Convex Intersection, ACM Transactions on Algorithms, 15:3, (1-41), Online publication date: 31-Jul-2019.
- Fomin F, Golovach P, Lokshtanov D, Saurabh S and Zehavi M (2018). Clique-width III, ACM Transactions on Algorithms, 15:1, (1-27), Online publication date: 31-Jan-2019.
- Norkin V, Gaivoronski A, Zaslavsky V and Knopov P (2018). Models of the Optimal Resource Allocation for the Critical Infrastructure Protection, Cybernetics and Systems Analysis, 54:5, (696-706), Online publication date: 1-Sep-2018.
- Ye Z, Say B and Sanner S Symbolic Bucket Elimination for Piecewise Continuous Constrained Optimization Integration of Constraint Programming, Artificial Intelligence, and Operations Research, (585-594)
- Schlesinger M, Flach B and Vodolazskiy E (2018). Finding a Given Number of Solutions to a System of Fuzzy Constraints*, Cybernetics and Systems Analysis, 54:1, (60-74), Online publication date: 1-Feb-2018.
- Golovach P, Lokshtanov D, Saurabh S and Zehavi M Cliquewidth III Proceedings of the Twenty-Ninth Annual ACM-SIAM Symposium on Discrete Algorithms, (262-273)
- Yolov N Minor-matching hypertree width Proceedings of the Twenty-Ninth Annual ACM-SIAM Symposium on Discrete Algorithms, (219-233)
- Flerova N, Marinescu R and Dechter R (2017). Weighted heuristic anytime search, Annals of Mathematics and Artificial Intelligence, 79:1-3, (77-128), Online publication date: 1-Mar-2017.
- Ghribi C, Mechtri M and Zeghlache D A Dynamic Programming Algorithm for Joint VNF Placement and Chaining Proceedings of the 2016 ACM Workshop on Cloud-Assisted Networking, (19-24)
- Allouche D, Bessiere C, Boizumault P, de Givry S, Gutierrez P, Lee J, Leung K, Loudni S, Métivier J, Schiex T and Wu Y (2016). Tractability-preserving transformations of global cost functions, Artificial Intelligence, 238:C, (166-189), Online publication date: 1-Sep-2016.
- Ismaili A and Perny P (2016). Computational social choice for coordination in agent networks, Annals of Mathematics and Artificial Intelligence, 77:3-4, (335-359), Online publication date: 1-Aug-2016.
- Kangas K, Hankala T, Niinimäki T and Koivisto M Counting linear extensions of sparse posets Proceedings of the Twenty-Fifth International Joint Conference on Artificial Intelligence, (603-609)
- Gottlob G, Greco G, Leone N and Scarcello F Hypertree Decompositions Proceedings of the 35th ACM SIGMOD-SIGACT-SIGAI Symposium on Principles of Database Systems, (57-74)
- Ismaili A, Bampis E, Maudet N and Perny P How the number of strategies impacts the likelihood of equilibria in random graphical games Proceedings of the 2014 international conference on Autonomous agents and multi-agent systems, (285-292)
- Jiroušek R and Shenoy P (2014). Compositional models in valuation-based systems, International Journal of Approximate Reasoning, 55:1, (277-293), Online publication date: 1-Jan-2014.
- Sviridenko A and Shcherbina O (2013). Block Local Elimination Algorithms for Sparse Discrete Optimization Problems, Cybernetics and Systems Analysis, 49:6, (932-935), Online publication date: 1-Nov-2013.
- Ismaili A, Bampis E, Maudet N and Perny P A study on the stability and efficiency of graphical games with unbounded treewidth Proceedings of the 2013 international conference on Autonomous agents and multi-agent systems, (263-270)
- Kolmogorov V and Živný S (2013). The complexity of conservative valued CSPs, Journal of the ACM, 60:2, (1-38), Online publication date: 1-Apr-2013.
- Cooper M, Escamocher G and źIvný S A Characterisation of the Complexity of Forbidding Subproblems in Binary Max-CSP Proceedings of the 18th International Conference on Principles and Practice of Constraint Programming - Volume 7514, (265-273)
- Oliehoek F, Whiteson S and Spaan M Exploiting structure in cooperative Bayesian games Proceedings of the Twenty-Eighth Conference on Uncertainty in Artificial Intelligence, (654-663)
- Wang J, Byrnes J, Valtorta M and Huhns M (2012). On the combination of logical and probabilistic models for information analysis, Applied Intelligence, 36:2, (472-497), Online publication date: 1-Mar-2012.
- Apsel U and Brafman R Extended lifted inference with joint formulas Proceedings of the Twenty-Seventh Conference on Uncertainty in Artificial Intelligence, (11-18)
- Gonzales C, Perny P and Dubus J (2011). Decision making with multiple objectives using GAI networks, Artificial Intelligence, 175:7-8, (1153-1179), Online publication date: 1-May-2011.
- Jeantet G and Spanjaard O (2011). Computing rank dependent utility in graphical models for sequential decision problems, Artificial Intelligence, 175:7-8, (1366-1389), Online publication date: 1-May-2011.
- Allouche D, De Givry S and Schiex T Towards parallel non serial dynamic programming for solving hard weighted CSP Proceedings of the 16th international conference on Principles and practice of constraint programming, (53-60)
- Larrosa J, Oliveras A and Rodríguez-Carbonell E Semiring-induced propositional logic Proceedings of the 16th international conference on Logic for programming, artificial intelligence, and reasoning, (332-347)
- Ravikumar P, Agarwal A and Wainwright M (2010). Message-passing for Graph-structured Linear Programs: Proximal Methods and Rounding Schemes, The Journal of Machine Learning Research, 11, (1043-1080), Online publication date: 1-Mar-2010.
- Gallardo J, Cotta C and Fernández A (2009). Solving weighted constraint satisfaction problems with memetic/exact hybrid algorithms, Journal of Artificial Intelligence Research, 35:1, (533-555), Online publication date: 1-May-2009.
- Grohe B and Wedelin D Cost propagation Proceedings of the 5th international conference on Integration of AI and OR techniques in constraint programming for combinatorial optimization problems, (97-111)
- Larrosa J, Heras F and de Givry S (2008). A logical approach to efficient Max-SAT solving, Artificial Intelligence, 172:2-3, (204-233), Online publication date: 1-Feb-2008.
- Escoffier B, Monnot J and Spanjaard O Some tractable instances of interval data minmax regret problems Proceedings of the 34th conference on Current trends in theory and practice of computer science, (280-291)
- Juengling R and Mitchell M Combinatorial shape decomposition Proceedings of the 3rd international conference on Advances in visual computing - Volume Part II, (183-192)
- Pouly M, Haenni R and Wachter M Compiling solution configurations in semiring valuation systems Proceedings of the artificial intelligence 6th Mexican international conference on Advances in artificial intelligence, (248-259)
- Pralet C, Verfaillie G and Schiex T (2007). An algebraic graphical model for decision with uncertainties, feasibilities, and utilities, Journal of Artificial Intelligence Research, 29:1, (421-489), Online publication date: 1-May-2007.
- Bidyuk B and Dechter R (2007). Cutset sampling for Bayesian networks, Journal of Artificial Intelligence Research, 28:1, (1-48), Online publication date: 1-Jan-2007.
- Kok J and Vlassis N (2006). Collaborative Multiagent Reinforcement Learning by Payoff Propagation, The Journal of Machine Learning Research, 7, (1789-1828), Online publication date: 1-Dec-2006.
- Ríos-Mercado R, Kim S and Boyd E (2006). Efficient operation of natural gas transmission systems, Computers and Operations Research, 33:8, (2323-2351), Online publication date: 1-Aug-2006.
- Kok J and Vlassis N Using the max-plus algorithm for multiagent decision making in coordination graphs RoboCup 2005, (1-12)
- Singhvi V, Krause A, Guestrin C, Garrett J and Matthews H Intelligent light control using sensor networks Proceedings of the 3rd international conference on Embedded networked sensor systems, (218-229)
- Wilson N Decision diagrams for the computation of semiring valuations Proceedings of the 19th international joint conference on Artificial intelligence, (331-336)
- Cooper M (2005). High-Order Consistency in Valued Constraint Satisfaction, Constraints, 10:3, (283-305), Online publication date: 1-Jul-2005.
- Mühlenbein H and Höns R Approximate factorizations of distributions and the minimum relative entropy principle Proceedings of the 7th annual workshop on Genetic and evolutionary computation, (199-211)
- Felzenszwalb P (2005). Representation and Detection of Deformable Shapes, IEEE Transactions on Pattern Analysis and Machine Intelligence, 27:2, (208-220), Online publication date: 1-Feb-2005.
- Amir E and McIlraith S (2005). Partition-based logical reasoning for first-order and propositional theories, Artificial Intelligence, 162:1-2, (49-88), Online publication date: 1-Feb-2005.
- Larrosa J, Morancho E and Niso D (2005). On the practical use of variable elimination in constraint optimization problems, Journal of Artificial Intelligence Research, 23:1, (421-440), Online publication date: 1-Jan-2005.
- Pandey S, Dhamdhere K and Olston C WIC Proceedings of the Thirtieth international conference on Very large data bases - Volume 30, (360-371)
- Guestrin C, Bodik P, Thibaux R, Paskin M and Madden S Distributed regression Proceedings of the 3rd international symposium on Information processing in sensor networks, (1-10)
- Kullmann O (2004). Upper and Lower Bounds on the Complexity of Generalised Resolution and Generalised Constraint Satisfaction Problems, Annals of Mathematics and Artificial Intelligence, 40:3-4, (303-352), Online publication date: 1-Mar-2004.
- Guestrin C, Koller D, Parr R and Venkataraman S (2003). Efficient solution algorithms for factored MDPs, Journal of Artificial Intelligence Research, 19:1, (399-468), Online publication date: 1-Jul-2003.
- Song Y, Goncalves L and Perona P (2003). Unsupervised Learning of Human Motion, IEEE Transactions on Pattern Analysis and Machine Intelligence, 25:7, (814-827), Online publication date: 1-Jul-2003.
- Larrosa J and Dechter R (2003). Boosting Search with Variable Elimination in Constraint Optimization and Constraint Satisfaction Problems, Constraints, 8:3, (303-326), Online publication date: 1-Jul-2003.
- Dechter R and Rish I (2003). Mini-buckets, Journal of the ACM, 50:2, (107-153), Online publication date: 1-Mar-2003.
- Poole D and Zhang N (2003). Exploiting contextual independence in probabilistic inference, Journal of Artificial Intelligence Research, 18:1, (263-313), Online publication date: 1-Jan-2003.
- (2002). Logic, Optimization, and Constraint Programming, INFORMS Journal on Computing, 14:4, (295-321), Online publication date: 1-Nov-2002.
- Vickrey D and Koller D Multi-agent algorithms for solving graphical games Eighteenth national conference on Artificial intelligence, (345-351)
- Guestrin C, Venkataraman S and Koller D Context-specific multiagent coordination and planning with factored MDPs Eighteenth national conference on Artificial intelligence, (253-259)
- Dechter R, Kask K, Bin E and Emek R Generating random solutions for constraint satisfaction problems Eighteenth national conference on Artificial intelligence, (15-21)
- Dechter R and Larkin D Hybrid processing of beliefs and constraints Proceedings of the Seventeenth conference on Uncertainty in artificial intelligence, (112-119)
- Wong S and Butz C (2001). Constructing the Dependency Structure of a Multiagent Probabilistic Network, IEEE Transactions on Knowledge and Data Engineering, 13:3, (395-415), Online publication date: 1-May-2001.
- Guestrin C, Koller D and Parr R Multiagent planning with factored MDPs Proceedings of the 15th International Conference on Neural Information Processing Systems: Natural and Synthetic, (1523-1530)
- Rish I and Dechter R (2000). Resolution versus Search, Journal of Automated Reasoning, 24:1-2, (225-275), Online publication date: 1-Feb-2000.
- Kask K and Dechter R Mini-bucket heuristics for improved search Proceedings of the Fifteenth conference on Uncertainty in artificial intelligence, (314-323)
- Bloemeke M and Valtorta M A hybrid algorithm to compute marginal and joint beliefs in Bayesian networks and its complexity Proceedings of the Fourteenth conference on Uncertainty in artificial intelligence, (16-23)
- Wierzchoń S and Klopotek M (1997). Modified Component Valuations in Valuation Based Systems as a Way to Optimize Query Processing, Journal of Intelligent Information Systems, 9:2, (157-180), Online publication date: 1-Sep-1997.
- Beale S Using branch-and-bound with constraint satisfaction in optimization problems Proceedings of the fourteenth national conference on artificial intelligence and ninth conference on Innovative applications of artificial intelligence, (209-214)
- Shenoy P Binary join trees Proceedings of the Twelfth international conference on Uncertainty in artificial intelligence, (492-499)
- El Fattah Y and Dechter R An evaluation of structural parameters for probabilistic reasoning Proceedings of the Twelfth international conference on Uncertainty in artificial intelligence, (244-251)
- Dechter R Bucket elimination Proceedings of the Twelfth international conference on Uncertainty in artificial intelligence, (211-219)
- Amit Y and Kong A (1996). Graphical Templates for Model Registration, IEEE Transactions on Pattern Analysis and Machine Intelligence, 18:3, (225-236), Online publication date: 1-Mar-1996.
- Zhang N Inference with causal independence in the CPSC network Proceedings of the Eleventh conference on Uncertainty in artificial intelligence, (582-589)
- Wong S, Butz C and Xiang Y A method for implementing a probabilistic model as a relational database Proceedings of the Eleventh conference on Uncertainty in artificial intelligence, (556-564)
- Shenoy P A fusion algorithm for solving Bayesian decision problems Proceedings of the Seventh conference on Uncertainty in Artificial Intelligence, (361-369)
- Wendel H (1987). The General Minimum Fill-In Problem, SIAM Journal on Algebraic and Discrete Methods, 8:4, (710-745), Online publication date: 1-Oct-1987.
- Helman P and Rosenthal A (1985). A Comprehensive Model of Dynamic Programming, SIAM Journal on Algebraic and Discrete Methods, 6:2, (319-334), Online publication date: 1-Apr-1985.
- Arnborg S (1985). Efficient algorithms for combinatorial problems on graphs with bounded decomposability — A survey, BIT, 25:1, (1-23), Online publication date: 1-Mar-1985.
- Kruskal J (2020). An Overview of Sequence Comparison, SIAM Review, 25:2, (201-237), Online publication date: 1-Apr-1983.
- Rosenthal A (1982). Dynamic Programming is Optimal for Nonserial Optimization Problems, SIAM Journal on Computing, 11:1, (47-59), Online publication date: 1-Feb-1982.
- Lipton R and Tarjan R (1980). Applications of a Planar Separator Theorem, SIAM Journal on Computing, 9:3, (615-627), Online publication date: 1-Aug-1980.
- Rosenthal A Nonserial dynamic programming is optimal Proceedings of the ninth annual ACM symposium on Theory of computing, (98-105)
- Rosenthal A (1977). Computing the Reliability of Complex Networks, SIAM Journal on Applied Mathematics, 32:2, (384-393), Online publication date: 1-Mar-1977.
- Martelli A (1976). An application of heuristic search methods to edge and contour detection, Communications of the ACM, 19:2, (73-83), Online publication date: 1-Feb-1976.
Recommendations
Dynamic Programming is Optimal for Nonserial Optimization Problems
We consider discrete optimization problems in which the only exploitable feature of the objective function is a limited form of decomposability. “Nonoverlapping comparison algorithms” are defined as a model of procedures which decompose the problem and ...
Nonserial dynamic programming is optimal
STOC '77: Proceedings of the ninth annual ACM symposium on Theory of computingWe show that nonserial dynamic programming is optimal among one class of algorithms for an important class of discrete optimization problems. We consider discrete, multivariate, optimization problems in which the objective function is given as a sum of ...
Improving locality of nonserial polyadic dynamic programming
IPDPS'06: Proceedings of the 20th international conference on Parallel and distributed processingDynamic programming (DP) is a commonly used technique for solving a wide variety of discrete optimization problems, which have different variants of dynamic programming formulation. This paper investigated one important DP formulation, which called ...