Lagrangian bounds from decision diagrams

DOI10.1007/s10601-015-9193-yzbMath1327.90116OpenAlexW2099452584MaRDI QIDQ890004

N. E. Zubov

Publication date: 9 November 2015

Published in: Constraints (Search for Journal in Brave)

Full work available at URL: http://hdl.handle.net/1807/79263

zbMATH Keywords

Lagrangian relaxationconstraint propagationdecision diagrams

Mathematics Subject Classification ID

Integer programming (90C10)

Related Items (10)

Constraint programming and operations research ⋮ Incorporating bounds from decision diagrams into integer programming ⋮ A Lagrangian propagator for artificial neural networks in constraint programming ⋮ Theoretical insights and algorithmic tools for decision diagram-based optimization ⋮ Decision Diagrams for Discrete Optimization: A Survey of Recent Advances ⋮ Exact solution of network flow models with strong relaxations ⋮ Multi-machine scheduling lower bounds using decision diagrams ⋮ Decision diagrams for solving traveling salesman problems with pickup and delivery in real time ⋮ An MDD-Based Lagrangian Approach to the Multicommodity Pickup-and-Delivery TSP ⋮ New exact techniques applied to a class of network flow formulations

Cites Work

• Integrated methods for optimization
• Optimization Bounds from Binary Decision Diagrams
• Manipulating MDD Relaxations for Combinatorial Optimization
• On Threshold BDDs and the Optimal Variable Ordering Problem
• Graph-Based Algorithms for Boolean Function Manipulation
• Binary Decision Diagrams
• Multivalued Decision Diagrams for Sequencing Problems
• Combining Arc-Consistency and Dual Lagrangean Relaxation for Filtering CSPs
• MDD Propagation for Sequence Constraints
• Experimental and Efficient Algorithms
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Lagrangian bounds from decision diagrams