Lagrangian bounds from decision diagrams
From MaRDI portal
Publication:890004
DOI10.1007/S10601-015-9193-YzbMATH Open1327.90116OpenAlexW2099452584MaRDI QIDQ890004FDOQ890004
Publication date: 9 November 2015
Published in: Constraints (Search for Journal in Brave)
Full work available at URL: http://hdl.handle.net/1807/79263
Cites Work
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- On Threshold BDDs and the Optimal Variable Ordering Problem
- Graph-Based Algorithms for Boolean Function Manipulation
- Manipulating MDD Relaxations for Combinatorial Optimization
- Multivalued Decision Diagrams for Sequencing Problems
- Integrated methods for optimization
- Binary Decision Diagrams
- Optimization Bounds from Binary Decision Diagrams
- MDD Propagation for Sequence Constraints
- Experimental and Efficient Algorithms
- Combining Arc-Consistency and Dual Lagrangean Relaxation for Filtering CSPs
Cited In (11)
- Incorporating bounds from decision diagrams into integer programming
- Theoretical insights and algorithmic tools for decision diagram-based optimization
- Constraint programming and operations research
- Optimization Bounds from Binary 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
- 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)
