Experimental and Efficient Algorithms
From MaRDI portal
Publication:5710044
DOI10.1007/b136461zbMath1121.90422OpenAlexW2485841483MaRDI QIDQ5710044
Bernd Becker, Markus Behle, Ralf Wimmer, Friedrich Eisenbrand
Publication date: 30 November 2005
Published in: Lecture Notes in Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/b136461
Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57) Boolean programming (90C09) Data structures (68P05)
Related Items
Incorporating bounds from decision diagrams into integer programming, Compressed data structures for bi-objective \(\{0,1\}\)-knapsack problems, Theoretical insights and algorithmic tools for decision diagram-based optimization, Lagrangian bounds from decision diagrams, Decision Diagrams for Discrete Optimization: A Survey of Recent Advances, Optimization Bounds from Binary Decision Diagrams, Target Cuts from Relaxed Decision Diagrams, On the Consistent Path Problem, Discrete Optimization with Decision Diagrams, On threshold BDDs and the optimal variable ordering problem, Decision Diagram Decomposition for Quadratically Constrained Binary Optimization, Exact Multiple Sequence Alignment by Synchronized Decision Diagrams, A combinatorial cut-and-lift procedure with an application to 0-1 second-order conic programming, A binary decision diagram based algorithm for solving a class of binary two-stage stochastic programs