Bounds for Random Binary Quadratic Programs
From MaRDI portal
Publication:4609468
DOI10.1137/16M109778XzbMath1396.90046OpenAlexW2790892842MaRDI QIDQ4609468
Dongjian Shi, Karthik Natarajan, Kim-Chuan Toh
Publication date: 3 April 2018
Published in: SIAM Journal on Optimization (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1137/16m109778x
Related Items
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Solving semidefinite-quadratic-linear programs using SDPT3
- The indefinite zero-one quadratic problem
- On the value of a random minimum spanning tree problem
- Probabilistic asymptotic properties of some combinatorial optimization problems
- Solving quadratic (0,1)-problems by semidefinite programs and cutting planes
- Quadratic \(0/1\) optimization and a decomposition approach for the placement of electronic circuits
- A MAX-CUT formulation of 0/1 programs
- A recipe for semidefinite relaxation for \((0,1)\)-quadratic programming
- 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
- Second order cone programming relaxation of nonconvex quadratic optimization problems
- Adaptive Memory Tabu Search for Binary Quadratic Programs
- Distributionally Robust Stochastic Knapsack Problem
- Second-Order Cone Relaxations for Binary Quadratic Polynomial Programs
- Introduction to Stochastic Programming
- Graph Implementations for Nonsmooth Convex Programs
- Convex majorization with an application to the length of critical paths
- Stochastic Analysis of the Quadratic Assignment Problem
- Lectures on Stochastic Programming
- Asymptotic Properties of the Quadratic Assignment Problem
- Stochastic Bounds on Distributions of Optimal Value Functions with Applications to PERT, Network Flows and Reliability
- An Application of Combinatorial Optimization to Statistical Physics and Circuit Layout Design
- 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 algorithm1
- Quadratic knapsack problems
- Minimum cuts and related problems
- 0-1 Quadratic programming approach for optimum solutions of two scheduling problems
- Improved approximation algorithms for maximum cut and satisfiability problems using semidefinite programming
- SDPT3 — A Matlab software package for semidefinite programming, Version 1.3
- Probabilistic Combinatorial Optimization: Moments, Semidefinite Programming, and Asymptotic Bounds
- Combinational optimization problems for which almost every algorithm is asymptotically optimal
- Bounds on Expected Project Tardiness
- Quadratic Binary Programming with Application to Capital-Budgeting Problems
