BDD-based optimization for the quadratic stable set problem

DOI10.1016/J.DISOPT.2020.100610MaRDI QIDQ2673237zbMATH OpenOpenAlexFDO

Authors J. González, Andre A. Cire, Andrea Lodi, Louis-Martin Rousseau

Publication date 9 June 2022

Published in Discrete Optimization (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/j.disopt.2020.100610

zbMATH Keywords

dynamic programminghybrid optimizationdecision diagramsquadratic stable set problembinary quadratic programs

Mathematics Subject Classification ID

Quadratic programming (90C20) Dynamic programming (90C39) Integer programming (90C10)

Recommendations

• Integrated integer programming and decision diagram search tree with an application to the maximum independent set problem
• Discrete optimization with decision diagrams
• Decomposition based on decision diagrams
• Optimization Bounds from Binary Decision Diagrams
• A hybrid constraint programming and semidefinite programming approach for the stable set problem

Cites work

• scientific article; zbMATH DE number 3168330 (Why is no real title available?)
• scientific article; zbMATH DE number 3639144 (Why is no real title available?)
• A column generation and branch-and-cut algorithm for the channel assignment problem
• A new branch-and-bound algorithm for the maximum edge-weighted clique problem
• A review on algorithms for maximum clique problems
• A subgradient approach for constrained binary optimization via quantum adiabatic evolution
• An MDD-Based Lagrangian Approach to the Multicommodity Pickup-and-Delivery TSP
• BiqCrunch: a semidefinite branch-and-bound method for solving binary quadratic problems
• Clique relaxations in social network analysis: the maximum \(k\)-plex problem
• Decision diagrams for optimization
• Decomposition based on decision diagrams
• Discrete optimization with decision diagrams
• Integrated integer programming and decision diagram search tree with an application to the maximum independent set problem
• Last-mile scheduling under uncertainty
• Learning a classification of mixed-integer quadratic programming problems
• Machine learning for combinatorial optimization: a methodological tour d'horizon
• Multivalued decision diagrams for sequencing problems
• Scikit-learn: machine learning in Python
• Support-vector networks
• Target cuts from relaxed decision diagrams
• Theoretical and computational study of several linearisation techniques for binary quadratic problems

Cited in

(3)

• Improving variable orderings of approximate decision diagrams using reinforcement learning
• Stochastic decision diagrams
• Decision Diagrams for Discrete Optimization: A Survey of Recent Advances

Describes a project that uses

Uses Software

• BiqCrunch
• Scikit

This page was built for publication: BDD-based optimization for the quadratic stable set problem

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