Cost-Bounded Binary Decision Diagrams for 0-1 Programming
From MaRDI portal
Publication:3612409
DOI10.1007/978-3-540-72397-4_7zbMath1214.90084OpenAlexW1687818379MaRDI QIDQ3612409
Publication date: 10 March 2009
Published in: Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-540-72397-4_7
Related Items (10)
Compressed data structures for bi-objective \(\{0,1\}\)-knapsack problems ⋮ A constraint programming based column generation approach to nurse rostering problems ⋮ Theoretical insights and algorithmic tools for decision diagram-based optimization ⋮ Stochastic decision diagrams ⋮ Decision Diagrams for Discrete Optimization: A Survey of Recent Advances ⋮ On the Consistent Path Problem ⋮ SCIP: global optimization of mixed-integer nonlinear programs in a branch-and-cut framework ⋮ Extensions to the repetitive branch and bound algorithm for globally optimal clusterwise regression ⋮ Discrete Optimization with Decision Diagrams ⋮ Postoptimal Analysis in Nonserial Dynamic Programming
This page was built for publication: Cost-Bounded Binary Decision Diagrams for 0-1 Programming
