In part I of this dissertation, certain rich geometric properties hidden behind quadratic 0-1 programming are investigated. Especially, we derive new lower bounding methods and variable fixation techniques for quadratic 0-1 optimization problems by investigating geometric features of the ellipse contour of a (perturbed) convex quadratic function. These findings further lead to some new optimality conditions for quadratic 0-1 programming. Integrating these novel solution schemes into a proposed solution algorithm of a branch-and-bound type, we obtain promising preliminary computational results.In part II of this dissertation, we present new results of the duality gap between the binary quadratic optimization problem and its Lagrangian dual. ...
In order to solve more easily combinatorial optimization problems, one way is to find theoretically ...
An extended canonical dual approach for solving 0-1 quadratic programming problems is introduced. We...
This dissertation investigates the Quadratic Unconstrained Binary Optimization (QUBO) problem, i.e. ...
SoumisNational audienceThis paper presents new semidefinite programming bounds for 0-1 quadratic pro...
At the intersection of combinatorial and nonlinear optimization, quadratic programming (QP) plays an...
In recent years the unconstrained binary quadratic program (UBQP) has grown in importance in the fie...
In recent years the unconstrained binary quadratic program (UBQP) has grown in importance in the fie...
International audienceThis article presents a family of semidefinite programming bounds, obtained by...
AbstractWe are concerned in this paper with techniques for computing upper bounds on the optimal obj...
This paper is concerned with binary quadratic programs (BQPs), which are among the most well-studied...
AbstractThe “roof dual” of a QUBO (Quadratic Unconstrained Binary Optimization) problem has been int...
In recent years the unconstrained quadratic binary program (UQP) has emerged as a unified framework ...
Finding integer solutions to linear equations has various real world applications. In the thesis, we...
In this dissertation, we consider the quadratic combinatorial optimization problem (QCOP) and its va...
Optimization is the process of maximizing or minimizing the objective function which satisfies the g...
In order to solve more easily combinatorial optimization problems, one way is to find theoretically ...
An extended canonical dual approach for solving 0-1 quadratic programming problems is introduced. We...
This dissertation investigates the Quadratic Unconstrained Binary Optimization (QUBO) problem, i.e. ...
SoumisNational audienceThis paper presents new semidefinite programming bounds for 0-1 quadratic pro...
At the intersection of combinatorial and nonlinear optimization, quadratic programming (QP) plays an...
In recent years the unconstrained binary quadratic program (UBQP) has grown in importance in the fie...
In recent years the unconstrained binary quadratic program (UBQP) has grown in importance in the fie...
International audienceThis article presents a family of semidefinite programming bounds, obtained by...
AbstractWe are concerned in this paper with techniques for computing upper bounds on the optimal obj...
This paper is concerned with binary quadratic programs (BQPs), which are among the most well-studied...
AbstractThe “roof dual” of a QUBO (Quadratic Unconstrained Binary Optimization) problem has been int...
In recent years the unconstrained quadratic binary program (UQP) has emerged as a unified framework ...
Finding integer solutions to linear equations has various real world applications. In the thesis, we...
In this dissertation, we consider the quadratic combinatorial optimization problem (QCOP) and its va...
Optimization is the process of maximizing or minimizing the objective function which satisfies the g...
In order to solve more easily combinatorial optimization problems, one way is to find theoretically ...
An extended canonical dual approach for solving 0-1 quadratic programming problems is introduced. We...
This dissertation investigates the Quadratic Unconstrained Binary Optimization (QUBO) problem, i.e. ...