Decision Diagram Decomposition for Quadratically Constrained Binary Optimization
From MaRDI portal
Publication:4995079
DOI10.1287/ijoc.2019.0938OpenAlexW3048993927MaRDI QIDQ4995079
No author found.
Publication date: 23 June 2021
Published in: INFORMS Journal on Computing (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1287/ijoc.2019.0938
Related Items (3)
Models and Algorithms for the Bin-Packing Problem with Minimum Color Fragmentation ⋮ Decision Diagrams for Discrete Optimization: A Survey of Recent Advances ⋮ A combinatorial cut-and-lift procedure with an application to 0-1 second-order conic programming
Uses Software
Cites Work
- Unnamed Item
- Decision diagrams for optimization
- Semidefinite relaxations for non-convex quadratic mixed-integer programming
- The unconstrained binary quadratic programming problem: a survey
- Compact representations of all members of an independence system
- An effective branch-and-bound algorithm for convex quadratic integer programming
- Improving the performance of standard solvers for quadratic 0-1 programs by a tight convex reformulation: The QCR method
- On the pathwidth of chordal graphs
- An efficient compact quadratic convex reformulation for general integer quadratic programs
- A brief history of linear and mixed-integer programming computation
- Discrete Optimization with Decision Diagrams
- Constructions and In-Place Operations for MDDs Based Constraints
- Oblivious bounds on the probability of boolean functions
- Optimization Bounds from Binary Decision Diagrams
- Manipulating MDD Relaxations for Combinatorial Optimization
- Computing the Minimum Fill-In is NP-Complete
- Improved Linear Integer Programming Formulations of Nonlinear Integer Problems
- A Class of Hard Small 0-1 Programs
- Technical Note—Converting the 0-1 Polynomial Programming Problem to a 0-1 Linear Program
- 0/1 vertex and facet enumeration with BDDs
- Pathwidth is NP-Hard for Weighted Trees
- Experimental and Efficient Algorithms
This page was built for publication: Decision Diagram Decomposition for Quadratically Constrained Binary Optimization
