Integrated integer programming and decision diagram search tree with an application to the maximum independent set problem

DOI10.1007/S10601-019-09306-WzbMath1452.90265OpenAlexW3000553024WikidataQ126345228 ScholiaQ126345228MaRDI QIDQ2195980

Jaime E. González, Louis-Martin Rousseau, Andrea Lodi, Andre A. Cire

Publication date: 28 August 2020

Published in: Constraints (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10601-019-09306-w

zbMATH Keywords

supervised learninginteger linear programminghybrid optimizationdecision diagramsintegrated methods

Mathematics Subject Classification ID

Integer programming (90C10) Learning and adaptive systems in artificial intelligence (68T05) Combinatorial optimization (90C27)

Related Items (4)

Stochastic decision diagrams ⋮ BDD-based optimization for the quadratic stable set problem ⋮ Decision Diagrams for Discrete Optimization: A Survey of Recent Advances ⋮ Improving the filtering of branch-and-bound MDD solver

Uses Software

• SATzilla
• Scikit

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Branch-and-price and constraint programming for solving a real-life technician dispatching problem
• Decision diagrams for optimization
• Integration of AI and OR techniques in contraint programming for combinatorial optimzation problems. 9th international conference, CPAIOR 2012, Nantes, France, May 28--June 1, 2012. Proceedings
• Integrated methods for optimization
• Constraint programming and operations research
• Learning a classification of mixed-integer quadratic programming problems
• Hybrid optimization methods for time-dependent sequencing problems
• Support-vector networks
• Discrete Optimization with Decision Diagrams
• Solving the Pricing Problem in a Branch-and-Price Algorithm for Graph Coloring Using Zero-Suppressed Binary Decision Diagrams
• Optimization Bounds from Binary Decision Diagrams
• Emergence of Scaling in Random Networks
• Planning and Scheduling by Logic-Based Benders Decomposition
• Graph-Based Algorithms for Boolean Function Manipulation
• Binary Decision Diagrams
• Target Cuts from Relaxed Decision Diagrams
• Multivalued Decision Diagrams for Sequencing Problems
• Collective dynamics of ‘small-world’ networks
• Random forests

This page was built for publication: Integrated integer programming and decision diagram search tree with an application to the maximum independent set problem