The Random QUBO

DOI10.1007/978-3-031-04520-2_7zbMath1506.90196OpenAlexW4285048469MaRDI QIDQ5050147

Karthik Natarajan

Publication date: 15 November 2022

Published in: The Quadratic Unconstrained Binary Optimization Problem (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-031-04520-2_7

zbMATH Keywords

dependent random variablesrandom optimal value

Mathematics Subject Classification ID

Quadratic programming (90C20) Stochastic programming (90C15) Boolean programming (90C09)

Uses Software

• SDPT3
• CVX

Cites Work

• Unnamed Item
• Unnamed Item
• Solving semidefinite-quadratic-linear programs using SDPT3
• Extending the QCR method to general mixed-integer programs
• Using a mixed integer quadratic programming solver for the unconstrained quadratic \(0-1\) problem
• Improving the performance of standard solvers for quadratic 0-1 programs by a tight convex reformulation: The QCR method
• On the value of a random minimum spanning tree problem
• Probabilistic asymptotic properties of some combinatorial optimization problems
• The Boolean quadratic polytope: Some characteristics, facets and relatives
• Geometric algorithms and combinatorial optimization
• A recipe for semidefinite relaxation for \((0,1)\)-quadratic programming
• The Parisi formula
• Persistence in discrete optimization under data uncertainty
• Computational aspects of a branch and bound algorithm for quadratic zero- one programming
• The ?(2) limit in the random assignment problem
• Graph Implementations for Nonsmooth Convex Programs
• Persistency Model and Its Applications in Choice Modeling
• Convex majorization with an application to the length of critical paths
• Robustness against dependence in PERT: An application of duality and distributions with known marginals
• Stochastic Bounds on Distributions of Optimal Value Functions with Applications to PERT, Network Flows and Reliability
• Class of global minimum bounds of polynomial functions
• A tight bound for the boolean quadratic optimization problem and its use in a branch and bound algorithm¹
• SDPT3 — A Matlab software package for semidefinite programming, Version 1.3
• Bounds for Random Binary Quadratic Programs
• Probabilistic Combinatorial Optimization: Moments, Semidefinite Programming, and Asymptotic Bounds
• The Sherrington-Kirkpatrick Model
• Optimization of the Sherrington--Kirkpatrick Hamiltonian
• Mean Field Models for Spin Glasses

This page was built for publication: The Random QUBO