Thesis (S.M.)--Massachusetts Institute of Technology, Sloan School of Management, Operations Research Center, 1999.Includes bibliographical references (leaves 107-111).We develop various algorithms for solving mixed integer-quadratic problems. These problems exhibit exponential complexity resulting from the presence of integer variables. Traditional approaches that apply in pure integer programming are not very helpful, since the existence of continuous variables in our problems complicates their use. Vie develop relaxation and heuristic algorithms designed so as to provide tight lower and upper bounds to the optimal solution of the mixed combinatorial problem. In some cases the obtained range, in which the optimum lies, is small enough to ...
AbstractTwo problems dealing with theory of numbers are considered. First, an unusual integer optimi...
Conic quadratic functions arise often when modeling uncertainty and risk-aversion, and are used in m...
AbstractThe integer and mixed cubic algorithms are proposed for full global solution of integer and ...
Many problems in economics, statistics and numerical analysis can be formulated as the optimization ...
Let (MQP) be a general mixed-integer quadratic program that consists of minimizing a quadratic funct...
We consider an integer program (QQP) where both the objective function and the constraints contain q...
National audienceAbstract. In this paper we consider the mixed integer general quadratic problem (MI...
Abstract. In this paper, we consider problem (P ) of minimizing a quadratic function q(x)=xtQx+ctx o...
This dissertation is devoted to solving general mixed integer optimization problems. Our main focus ...
It is well known that semidefinite programming (SDP) can be used to derive useful relaxations for a ...
As shown by Manne and Vietorisz (1963) investment planning problems involving economies of scale and...
This paper introduces a heuristic for mixed-integer mathematical programs, that can be seen as a gen...
The problem of optimizing multivariate scalar polynomial functions over mixed-integer points in poly...
We consider discrete bilevel optimization problems where the follower solves an integer program with...
We consider discrete bilevel optimization problems where the follower solves an integer pro...
AbstractTwo problems dealing with theory of numbers are considered. First, an unusual integer optimi...
Conic quadratic functions arise often when modeling uncertainty and risk-aversion, and are used in m...
AbstractThe integer and mixed cubic algorithms are proposed for full global solution of integer and ...
Many problems in economics, statistics and numerical analysis can be formulated as the optimization ...
Let (MQP) be a general mixed-integer quadratic program that consists of minimizing a quadratic funct...
We consider an integer program (QQP) where both the objective function and the constraints contain q...
National audienceAbstract. In this paper we consider the mixed integer general quadratic problem (MI...
Abstract. In this paper, we consider problem (P ) of minimizing a quadratic function q(x)=xtQx+ctx o...
This dissertation is devoted to solving general mixed integer optimization problems. Our main focus ...
It is well known that semidefinite programming (SDP) can be used to derive useful relaxations for a ...
As shown by Manne and Vietorisz (1963) investment planning problems involving economies of scale and...
This paper introduces a heuristic for mixed-integer mathematical programs, that can be seen as a gen...
The problem of optimizing multivariate scalar polynomial functions over mixed-integer points in poly...
We consider discrete bilevel optimization problems where the follower solves an integer program with...
We consider discrete bilevel optimization problems where the follower solves an integer pro...
AbstractTwo problems dealing with theory of numbers are considered. First, an unusual integer optimi...
Conic quadratic functions arise often when modeling uncertainty and risk-aversion, and are used in m...
AbstractThe integer and mixed cubic algorithms are proposed for full global solution of integer and ...