Global optimality conditions and optimization methods for quadratic integer programming problems
From MaRDI portal
Publication:652691
DOI10.1007/s10898-011-9650-0zbMath1247.90199OpenAlexW1971586018MaRDI QIDQ652691
Jing Quan, Zhi-You Wu, Guoquan Li
Publication date: 15 December 2011
Published in: Journal of Global Optimization (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10898-011-9650-0
global optimality conditionsauxiliary functionoptimization methodquadratic integer programming problem
Integer programming (90C10) Quadratic programming (90C20) Optimality conditions and duality in mathematical programming (90C46)
Related Items (3)
A new global optimization technique by auxiliary function method in a directional search ⋮ A polynomial case of convex integer quadratic programming problems with box integer constraints ⋮ Global optimization algorithm for mixed integer quadratically constrained quadratic program
Uses Software
Cites Work
- New bounds on the unconstrained quadratic integer programming problem
- A Max-flow approach to improved lower bounds for quadratic unconstrained binary optimization (QUBO)
- Non-convex quadratic minimization problems with quadratic constraints: global optimality conditions
- The equitable dispersion problem
- Ranking in quadratic integer programming problems
- An enumerative algorithm framework for a class of nonlinear integer programming problems
- Global optimization techniques for solving the general quadratic integer programming problem
- A provable better Branch and Bound method for a nonconvex integer quadratic programming problem
- Global optimality conditions for quadratic \(0-1\) optimization problems
- A new variable reduction technique for convex integer quadratic programs
- Lagrangian smoothing heuristics for Max-cut
- On the gap between the quadratic integer programming problem and its semidefinite relaxation
- Lower bound improvement and forcing rule for quadratic binary programming
- Computational aspects of a branch and bound algorithm for quadratic zero- one programming
- An algorithm for indefinite integer quadratic programming
- Global Optimality Conditions for Quadratic Optimization Problems with Binary Constraints
- Rank-Two Relaxation Heuristics for MAX-CUT and Other Binary Quadratic Programs
- Outward rotations
- An algorithmic approach to analyse genetic networks and biological energy production: an introduction and contribution where OR meets biology†
- Improved approximation algorithms for maximum cut and satisfiability problems using semidefinite programming
- An approximate algorithm for nonlinear integer programming
- Quadratic binary programming and dynamical system approach to determine the predictability of epileptic seizures
- Abstract convexity and global optimization
- Unnamed Item
- Unnamed Item
- Unnamed Item
This page was built for publication: Global optimality conditions and optimization methods for quadratic integer programming problems
