Global optimality conditions and optimization methods for quadratic integer programming problems
From MaRDI portal
Publication:652691
DOI10.1007/S10898-011-9650-0zbMATH Open1247.90199OpenAlexW1971586018MaRDI QIDQ652691FDOQ652691
Authors: Zhiyou Wu, G. Q. Li, J. Quan 
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
Recommendations
- Global optimality conditions for mixed integer quadratic programming problems
- A new local and global optimization method for mixed integer quadratic programming problems
- Global optimality conditions for quadratic \(0-1\) optimization problems
- Global optimality conditions and optimization methods for quadratic assignment problems
- Optimization methods for a class of integer polynomial programming problems
global optimality conditionsauxiliary functionoptimization methodquadratic integer programming problem
Quadratic programming (90C20) Optimality conditions and duality in mathematical programming (90C46) Integer programming (90C10)
Cites Work
- Rank-two relaxation heuristics for MAX-CUT and other binary quadratic programs
- Title not available (Why is that?)
- Global optimality conditions for quadratic optimization problems with binary constraints
- Non-convex quadratic minimization problems with quadratic constraints: global optimality conditions
- Abstract convexity and global optimization
- Lagrangian smoothing heuristics for Max-cut
- Improved approximation algorithms for maximum cut and satisfiability problems using semidefinite programming
- The equitable dispersion problem
- Computational aspects of a branch and bound algorithm for quadratic zero- one programming
- A Max-flow approach to improved lower bounds for quadratic unconstrained binary optimization (QUBO)
- Outward rotations: a tool for rounding solutions of semidefinite programming relaxations, with applications to max cut and other problems
- On the gap between the quadratic integer programming problem and its semidefinite relaxation
- Global optimality conditions for quadratic \(0-1\) optimization problems
- Title not available (Why is that?)
- A provable better Branch and Bound method for a nonconvex integer quadratic programming problem
- Lower bound improvement and forcing rule for quadratic binary programming
- Quadratic binary programming and dynamical system approach to determine the predictability of epileptic seizures
- Global optimization techniques for solving the general quadratic integer programming problem
- Ranking in quadratic integer programming problems
- An algorithm for indefinite integer quadratic programming
- An approximate algorithm for nonlinear integer programming
- New bounds on the unconstrained quadratic integer programming problem
- An enumerative algorithm framework for a class of nonlinear integer programming problems
- A new variable reduction technique for convex integer quadratic programs
- Quadratic binary programming models in computational biology
- An algorithmic approach to analyse genetic networks and biological energy production: an introduction and contribution where OR meets biology†
Cited In (14)
- Global optimality conditions for some classes of polynomial integer programming problems
- Optimization methods for a class of integer polynomial programming problems
- Global optimality conditions and optimization methods for quadratic assignment problems
- Global optimality conditions for a class of polynomial integer programming problems with linear constraints
- Global extremal conditions for multi-integer quadratic programming
- Global optimality conditions for quadratic \(0-1\) optimization problems
- A new local and global optimization method for mixed integer quadratic programming problems
- Global optimality conditions for fixed charge quadratic programs
- A polynomial case of convex integer quadratic programming problems with box integer constraints
- Global optimal solution to quadratic discrete programming problem with inequality constraints
- Title not available (Why is that?)
- A new global optimization technique by auxiliary function method in a directional search
- Global optimality conditions for mixed integer quadratic programming problems
- Global optimization algorithm for mixed integer quadratically constrained quadratic program
Uses Software
This page was built for publication: Global optimality conditions and optimization methods for quadratic integer programming problems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q652691)
