Experimental and Efficient Algorithms

DOI10.1007/B136461MaRDI QIDQ5710044zbMATH OpenOpenAlexFDO

Authors Bernd Becker, Markus Behle, Friedrich Eisenbrand, Ralf Wimmer

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

Mathematics Subject Classification ID

Data structures (68P05) Boolean programming (90C09) Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57)

Recommendations

• Discrete optimization with decision diagrams
• Cost-Bounded Binary Decision Diagrams for 0-1 Programming
• Compact representations of all members of an independence system
• Optimization Bounds from Binary Decision Diagrams
• On Threshold BDDs and the Optimal Variable Ordering Problem

Cited in

(20)

• On threshold BDDs and the optimal variable ordering problem
• Compressed data structures for bi-objective \(\{0,1\}\)-knapsack problems
• 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
• Theoretical insights and algorithmic tools for decision diagram-based optimization
• Discrete optimization with decision diagrams
• Optimization Bounds from Binary Decision Diagrams
• Cost-Bounded Binary Decision Diagrams for 0-1 Programming
• scientific article; zbMATH DE number 834569 (Why is no real title available?)
• Decision Diagram Decomposition for Quadratically Constrained Binary Optimization
• Exact Multiple Sequence Alignment by Synchronized Decision Diagrams
• Decision Diagrams for Discrete Optimization: A Survey of Recent Advances
• Compact representations of all members of an independence system
• Target cuts from relaxed decision diagrams
• On the consistent path problem
• Formal Methods in Computer-Aided Design
• Tight upper and lower bounds for the quadratic knapsack problem through binary decision diagrams
• Enumerating minimum feedback vertex sets in directed graphs with union-cat trees
• Incorporating bounds from decision diagrams into integer programming
• Lagrangian bounds from decision diagrams

This page was built for publication: Experimental and Efficient Algorithms

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5710044)