A large class of separable quadratic programming problems is presented. The problems in the class can be solved in linear time. The class includes the separable convex quadratic transportation problem with a fixed number of sources and separable convex quadratic programming with nonnegativityconstraints and a fixed numberoflinearequality constraints
We present new strongly polynomial algorithms for special cases of convex separable quadratic minimi...
AbstractA recent paper by Hochbaum and Shanthikumar presented “a general-purpose algorithm for conve...
Below we adapt some randomized algorithms of Welzl [10] and Clarkson [3] for linear programming to t...
The paper considers a quadratic programming problem with a strictly convex separable objective funct...
In this book, the author considers separable programming and, in particular, one of its important ca...
An algorithm for solving linearly constrained general convex quadratic problems is proposed *. The e...
International audienceWe consider quadratic programs with pure general integer variables. The object...
The paper considers the minimization of a separable convex function subject to linear ascending cons...
. A randomized algorithm for finding a hyperplane separating two finite point sets in the Euclidean ...
Abstract: Discrete time linear quadratic optimization problem with time delay and system constraint...
The Quadratic Assignment Problem is one of the hardest combinatorial optimization problems known. We...
AbstractThe Quadratic Assignment Problem is one of the hardest combinatorial optimization problems k...
A solution procedure for linear programs with one convex quadratic constraint is suggested. The meth...
Abstract. It is demonstrated hat he linear programming problem in d variables and n constraints can ...
In this paper, we present an effective algorithm for globally solving quadratic programs with quadra...
We present new strongly polynomial algorithms for special cases of convex separable quadratic minimi...
AbstractA recent paper by Hochbaum and Shanthikumar presented “a general-purpose algorithm for conve...
Below we adapt some randomized algorithms of Welzl [10] and Clarkson [3] for linear programming to t...
The paper considers a quadratic programming problem with a strictly convex separable objective funct...
In this book, the author considers separable programming and, in particular, one of its important ca...
An algorithm for solving linearly constrained general convex quadratic problems is proposed *. The e...
International audienceWe consider quadratic programs with pure general integer variables. The object...
The paper considers the minimization of a separable convex function subject to linear ascending cons...
. A randomized algorithm for finding a hyperplane separating two finite point sets in the Euclidean ...
Abstract: Discrete time linear quadratic optimization problem with time delay and system constraint...
The Quadratic Assignment Problem is one of the hardest combinatorial optimization problems known. We...
AbstractThe Quadratic Assignment Problem is one of the hardest combinatorial optimization problems k...
A solution procedure for linear programs with one convex quadratic constraint is suggested. The meth...
Abstract. It is demonstrated hat he linear programming problem in d variables and n constraints can ...
In this paper, we present an effective algorithm for globally solving quadratic programs with quadra...
We present new strongly polynomial algorithms for special cases of convex separable quadratic minimi...
AbstractA recent paper by Hochbaum and Shanthikumar presented “a general-purpose algorithm for conve...
Below we adapt some randomized algorithms of Welzl [10] and Clarkson [3] for linear programming to t...
DOI
Add to ORKG