Using DRL^* relaxations for quadratically constrained pseudoboolean optimization: application to robust Min-Cut
From MaRDI portal
Publication:2861558
Recommendations
- DRL\(^*\): A hierarchy of strong block-decomposable linear relaxations for 0-1 mips
- On linear conic relaxation of discrete quadratic programs
- Minimization of a quadratic pseudo-Boolean function
- On using cutting planes in pseudo-Boolean optimization
- A Max-flow approach to improved lower bounds for quadratic unconstrained binary optimization (QUBO)
Cites work
- A hierarchy of relaxations and convex hull characterizations for mixed- integer zero-one programming problems
- A Hierarchy of Relaxations between the Continuous and Convex Hull Representations for Zero-One Programming Problems
- A lift-and-project cutting plane algorithm for mixed 0-1 programs
- Algorithms and Computation
- Combinatorial optimization. Polyhedra and efficiency (3 volumes)
- Combinatorial optimization. Theory and algorithms.
- DRL\(^*\): A hierarchy of strong block-decomposable linear relaxations for 0-1 mips
- Robust discrete optimization and its applications
- Robust optimization-methodology and applications
This page was built for publication: Using \(\mathrm{DRL}^*\) relaxations for quadratically constrained pseudoboolean optimization: application to robust Min-Cut
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2861558)
