SIGLEAvailable from TIB Hannover: RO 4467(1992,17) / FIZ - Fachinformationszzentrum Karlsruhe / TIB - Technische InformationsbibliothekDEGerman
AbstractThis paper gives theorems on the boundedness of the feasible and the optimal solutions sets ...
Includes bibliographical references. Title from coverAvailable from British Library Document Supply ...
We investigate the use of linear programming tools for solving semidefinite programming relaxations ...
We present a simple randomized algorithm which solves linear programs with n constraints and d varia...
SIGLEAvailable from Bibliothek des Instituts fuer Weltwirtschaft, ZBW, Duesternbrook Weg 120, D-2410...
This report describes a subprogram, SPLP(), for solving linear programming problems. The package of ...
Improved Bounds and Containing Ellipsoids in Karmarkar's Linear Programming Algorith
An upper bound is given for the number of non-unique assignments when solving the linear programming...
A Lower Bound on the Number of Iterations of Primal-Dual Interior-Point Methods for Linear Programmi...
Abstract Title: Analysis of reduced and shadow prices in linear programming problems with lower and ...
A Lower Bound on the Number of Iterations of Long-Step and Polynomial Interior-Point Linear Programm...
SIGLETIB Hannover: RO 3476(60) / FIZ - Fachinformationszzentrum Karlsruhe / TIB - Technische Informa...
Abstract. A wide variety of problems in global optimization, combinatorial optimization as well as s...
With a common background and motivation, the main contributions of this paper are developed in two d...
We develop a framework for proving approximation limits of polynomial size linear programs (LPs) fro...
AbstractThis paper gives theorems on the boundedness of the feasible and the optimal solutions sets ...
Includes bibliographical references. Title from coverAvailable from British Library Document Supply ...
We investigate the use of linear programming tools for solving semidefinite programming relaxations ...
We present a simple randomized algorithm which solves linear programs with n constraints and d varia...
SIGLEAvailable from Bibliothek des Instituts fuer Weltwirtschaft, ZBW, Duesternbrook Weg 120, D-2410...
This report describes a subprogram, SPLP(), for solving linear programming problems. The package of ...
Improved Bounds and Containing Ellipsoids in Karmarkar's Linear Programming Algorith
An upper bound is given for the number of non-unique assignments when solving the linear programming...
A Lower Bound on the Number of Iterations of Primal-Dual Interior-Point Methods for Linear Programmi...
Abstract Title: Analysis of reduced and shadow prices in linear programming problems with lower and ...
A Lower Bound on the Number of Iterations of Long-Step and Polynomial Interior-Point Linear Programm...
SIGLETIB Hannover: RO 3476(60) / FIZ - Fachinformationszzentrum Karlsruhe / TIB - Technische Informa...
Abstract. A wide variety of problems in global optimization, combinatorial optimization as well as s...
With a common background and motivation, the main contributions of this paper are developed in two d...
We develop a framework for proving approximation limits of polynomial size linear programs (LPs) fro...
AbstractThis paper gives theorems on the boundedness of the feasible and the optimal solutions sets ...
Includes bibliographical references. Title from coverAvailable from British Library Document Supply ...
We investigate the use of linear programming tools for solving semidefinite programming relaxations ...
DOI
Add to ORKG