Lower bound improvement and forcing rule for quadratic binary programming
From MaRDI portal
Publication:2506180
Recommendations
- An improved lower bound and approximation algorithm for binary constrained quadratic programming problem
- scientific article; zbMATH DE number 714527
- Improved lower bounds for the quadratic assignment problem
- Improving a Lagrangian decomposition for the unconstrained binary quadratic programming problem
- scientific article; zbMATH DE number 714532
- Lower bounds based on linear programming for the quadratic assignment problem
- On lower bounds for a class of quadratic 0,1 programs
- A tight lower bound for a special case of quadratic 0-1 programming
- A Constructive Method for Improving Lower Bounds for a Class of Quadratic Assignment Problems
- A Max-flow approach to improved lower bounds for quadratic unconstrained binary optimization (QUBO)
Cites work
- An Implicit Enumeration Algorithm for Quadratic Integer Programming
- Approximating quadratic programming with bound and quadratic constraints
- Complexity of uniqueness and local search in quadratic 0-1 programming
- Computational aspects of a branch and bound algorithm for quadratic zero- one programming
- Construction of test problems in quadratic bivalent programming
- Convex Analysis
- Ellipsoidal approach to box-constrained quadratic problems
- Experiments in quadratic 0-1 programming
- Global optimality conditions for quadratic optimization problems with binary constraints
- scientific article; zbMATH DE number 3643044 (Why is no real title available?)
- scientific article; zbMATH DE number 4008098 (Why is no real title available?)
- Improved approximation algorithms for maximum cut and satisfiability problems using semidefinite programming
- Introduction to global optimization.
- Methods of Nonlinear 0-1 Programming
- Quadratic binary programming and dynamical system approach to determine the predictability of epileptic seizures
- Quadratic knapsack problems
Cited in
(19)- The equitable dispersion problem
- Improving a Lagrangian decomposition for the unconstrained binary quadratic programming problem
- Global optimality conditions for quadratic \(0-1\) optimization problems
- Improved row-by-row method for binary quadratic optimization problems
- On characterization of maximal independent sets via quadratic optimization
- Building an iterative heuristic solver for a quantum annealer
- On linear conic relaxation of discrete quadratic programs
- The unconstrained binary quadratic programming problem: a survey
- An exact solution method for unconstrained quadratic 0--1 programming: a geometric approach
- Two-stage quadratic integer programs with stochastic right-hand sides
- On duality gap in binary quadratic programming
- Global equilibrium search applied to the unconstrained binary quadratic optimization problem
- Separable relaxation for nonconvex quadratic integer programming: Integer diagonalization approach
- Global optimality conditions and optimization methods for quadratic integer programming problems
- Stability of semilinear elliptic optimal control problems with pointwise state constraints
- The spherical constraint in Boolean quadratic programs
- Box-constrained quadratic programs with fixed charge variables
- A Max-flow approach to improved lower bounds for quadratic unconstrained binary optimization (QUBO)
- A new branch and bound method with pretreatment for the binary quadratic programming
This page was built for publication: Lower bound improvement and forcing rule for quadratic binary programming
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2506180)
