default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDMathematical Programming, Volume 44
Volume 44, Numbers 1-3, May 1989
- Masakazu Kojima, Shinji Mizuno, Akiko Yoshise
:
A polynomial-time algorithm for a class of linear complementarity problems. 1-26 - Renato D. C. Monteiro, Ilan Adler:
Interior path following primal-dual algorithms. part I: Linear programming. 27-41 - Renato D. C. Monteiro, Ilan Adler:
Interior path following primal-dual algorithms. part II: Convex quadratic programming. 43-66 - A. C. Williams:
Marginal values in mixed integer linear programming. 67-75 - N. Eagambaram, S. R. Mohan:
On strongly degenerate complementary cones and solution rays. 77-83 - Shu-Cherng Fang, J. R. Rajasekera:
Quadratically constrained minimum cross-entropy analysis. 85-96 - Zaw Win:
On the Windy Postman Problem on eulerian graphs. 97-112 - R. B. Bapat:
A constructive proof of a permutation-based generalization of Sperner's lemma. 113-120 - Peter Zencke, Rainer Hettich:
Directional derivatives for the value-function in semi-infinite programming. 121 - Francisco Barahona, Michael Jünger, Gerhard Reinelt:
Experiments in quadratic 0-1 programming. 127-137 - Yves Crama:
Recognition problems for special classes of polynomials in 0-1 variables. 139-155 - Yinyu Ye, Edison Tse:
An extension of Karmarkar's projective algorithm for convex quadratic programming. 157-179 - Antonio Sassano:
On the facial structure of the set covering polytope. 181-202 - Martin E. Dyer, Alan M. Frieze:
A randomized algorithm for fixed-dimensional linear programming. 203-212 - Walter Kern:
A probabilistic analysis of the switching algorithm for the euclidean TSP. 213-219 - Stephen J. Wright:
An inexact algorithm for composite nondifferentiable optimization. 221-234 - Dominique de Werra:
Generalized edge packings. 235-245 - Edward J. Anderson, Adrian S. Lewis:
An extension of the simplex algorithm for semi-infinite linear programming. 247-269 - Janny M. Y. Leung, Thomas L. Magnanti:
Valid inequalities and facets of the capacitated plant location problem. 271-291 - Ramaswamy Chandrasekaran, Arie Tamir:
Open questions concerning Weiszfeld's algorithm for the Fermat-Weber location problem. 293-295 - Ilan Adler, Mauricio G. C. Resende, Geraldo Veiga, Narendra Karmarkar:
An implementation of Karmarkar's algorithm for linear programming. 297-335 - Egon Balas, Joseph M. Tama, Jørgen Tind:
Sequential convexification in reverse convex and disjunctive programming. 337-350 - Melvyn W. Jeter, Wallace C. Pye:
An example of a nonregular semimonotoneQ-matrix. 351-356 - Ding-Zhu Du, Xiang-Sun Zhang:
Global convergence of Rosen's gradient projection method. 357-366
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
last updated on 2025-12-04 22:09 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
