BDD-based optimization for the quadratic stable set problem

DOI10.1016/J.DISOPT.2020.100610OpenAlexW3081538319MaRDI QIDQ2673237FDOQ2673237

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

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

zbMATH Keywords

dynamic programminghybrid optimizationdecision diagramsquadratic stable set problembinary quadratic programs

Mathematics Subject Classification ID

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

Cites Work

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

Cited In (3)

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

Uses Software

• Scikit
• BiqCrunch

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)