A filled function method for quadratic programs with binary constraints†
From MaRDI portal
Publication:5193139
DOI10.1080/02331930902928757zbMath1172.90459OpenAlexW2073895850MaRDI QIDQ5193139
Yong-jian Yang, Zhi-You Wu, Fu-Sheng Bai
Publication date: 11 August 2009
Published in: Optimization (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1080/02331930902928757
global optimizationfilled function methodbinary constraintsglobal optimality conditionsquadratic programs
Related Items (1)
Cites Work
- ``Miniaturized linearizations for quadratic 0/1 problems
- Using a mixed integer quadratic programming solver for the unconstrained quadratic \(0-1\) problem
- A filled function method for finding a global minimizer of a function of several variables
- Non-convex quadratic minimization problems with quadratic constraints: global optimality conditions
- A class of filled functions for finding global minimizers of a function of several variables
- The max-cut problem and quadratic 0-1 optimization; polyhedral aspects, relaxations and bounds
- Global optimization techniques for solving the general quadratic integer programming problem
- Discrete filled function method for discrete global optimization
- A new filled function method for nonlinear integer programming problem
- Lagrangian smoothing heuristics for Max-cut
- Computational aspects of a branch and bound algorithm for quadratic zero- one programming
- Global Optimality Conditions for Quadratic Optimization Problems with Binary Constraints
- Rank-Two Relaxation Heuristics for MAX-CUT and Other Binary Quadratic Programs
- Global optimality conditions for mixed nonconvex quadratic programs†
- 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
This page was built for publication: A filled function method for quadratic programs with binary constraints†
