Computational Optimization and Applications

A matrix nonconvex relaxation approach to unconstrained binary polynomial programs

Yitian Qian, Shaohua Pan, Shujun Bi

Published Dec 27, 2022• 0 citations

Related papers

Polynomial time solvable algorithms to a class of unconstrained and linearly constrained binary quadratic programming problems

Shenshen Gu, Rui Cui, Peng Jiao

Semidefinite Programming Based Convex Relaxation for Nonconvex Quadratically Constrained Quadratic Programming

Rujun Jiang, Duan Li

Solving unconstrained 0-1 polynomial programs through quadratic convex reformulation

Sourour Elloumi, Amélie Lambert, Arnaud Lazare

The unconstrained binary quadratic programming problem: a survey

Gary A. Kochenberger, Jin‐Kao Hao, Fred Glover +4 more

A scatter search approach to unconstrained quadratic binary programs

Mohammad M. Amini, Bahram Alidaee, Gary A. Kochenberger

An effective approach for DNN relaxation problems for mixed binary nonconvex quadratic optimization,

未来田中, Mirai Tanaka, 和秀中田 +3 more