Recommendations
- Incorporating bounds from decision diagrams into integer programming
- Optimization Bounds from Binary Decision Diagrams
- A local search framework for compiling relaxed decision diagrams
- \(\mathrm{A}^*\)-based construction of decision diagrams for a prize-collecting scheduling problem
- Discrete optimization with decision diagrams
Cites work
- scientific article; zbMATH DE number 2084780 (Why is no real title available?)
- scientific article; zbMATH DE number 3793772 (Why is no real title available?)
- scientific article; zbMATH DE number 3353170 (Why is no real title available?)
- Binary Decision Diagrams
- Combining Arc-Consistency and Dual Lagrangean Relaxation for Filtering CSPs
- Experimental and Efficient Algorithms
- Graph-Based Algorithms for Boolean Function Manipulation
- Handbook of constraint programming.
- Integrated methods for optimization
- MDD propagation for sequence constraints
- Manipulating MDD relaxations for combinatorial optimization
- Multivalued decision diagrams for sequencing problems
- On Threshold BDDs and the Optimal Variable Ordering Problem
- Optimization Bounds from Binary Decision Diagrams
Cited in
(15)- Incorporating bounds from decision diagrams into integer programming
- Theoretical insights and algorithmic tools for decision diagram-based optimization
- Constraint programming and operations research
- Lagrangian decomposition via sub-problem search
- Optimization Bounds from Binary Decision Diagrams
- A local search framework for compiling relaxed decision diagrams
- An MDD-Based Lagrangian Approach to the Multicommodity Pickup-and-Delivery TSP
- Decision diagrams for solving traveling salesman problems with pickup and delivery in real time
- A Lagrangian propagator for artificial neural networks in constraint programming
- \(\mathrm{A}^*\)-based construction of decision diagrams for a prize-collecting scheduling problem
- Improved Peel-and-Bound: Methods for Generating Dual Bounds with Multivalued Decision Diagrams
- Multi-machine scheduling lower bounds using decision diagrams
- New exact techniques applied to a class of network flow formulations
- Decision Diagrams for Discrete Optimization: A Survey of Recent Advances
- Exact solution of network flow models with strong relaxations
This page was built for publication: Lagrangian bounds from decision diagrams
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q890004)
