default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDMathematical Programming, Volume 85
Volume 85, Number 1, May 1999
- Stephen M. Robinson:
Composition duality and maximal monotonicity. 1-13 - Hugues Marchand, Laurence A. Wolsey:
The 0-1 Knapsack problem with a single continuous variable. 15-33 - Henk Norde:
Bimatrix games have quasi-strict equilibria. 35-49 - Masakazu Kojima, Masayuki Shida, Susumu Shindoh:
Search directions in the SDP and the monotone SDLCP: generalization and inexact computation. 51-80 - Christian Kanzow, Houduo Qi:
A QP-free constrained Newton-type method for variational inequality problems. 81-106 - Francisco Facchinei
, Houyuan Jiang, Liqun Qi:
A smoothing method for mathematical programs with equilibrium constraints. 107-134 - Kaj Madsen, Hans Bruun Nielsen, Mustafa Ç. Pinar:
Bound constrained quadratic programming via piecewise quadratic functions. 135-156 - Kaj Holmberg, Hoang Tuy:
A production-transportation problem with stochastic demand and concave production costs. 157-179 - William W. Hager, M. Seetharama Gowda:
Stability in the presence of degeneracy and error estimation. 181-192 - Nguyen Nang Tam, Nguyen Dong Yen:
Continuity properties of the Karush-Kuhn-Tucker point set in quadratic programming problems. 193-206 - Jean-Louis Goffin, Krzysztof C. Kiwiel:
Convergence of a simple subgradient level method. 207-211 - Jack Brimberg, Nenad Mladenovic:
Degeneracy in the multi-source Weber problem. 213-220
Volume 85, Number 2, June 1999
- Kurt M. Anstreicher, Marcia Fampa, Jon Lee, Joy Williams:
Using continuous nonlinear relaxations to solve. constrained maximum-entropy sampling problems. 221-240 - Krzysztof C. Kiwiel:
A bundle Bregman proximal method for convex nondifferentiable minimization. 241-258 - Jesús A. De Loera, Walter D. Morris Jr.:
Q-matrix recognition via secondary and universal polytopes. 259-276 - Boris V. Cherkassky, Andrew V. Goldberg:
Negative-cycle detection algorithms. 277-311 - Xiaojun Chen, Masao Fukushima:
Proximal quasi-Newton methods for nondifferentiable convex optimization. 313-334 - Biao Gao, Frank K. Hwang, Wen-Ching Winnie Li, Uriel G. Rothblum:
Partition polytopes over 1-dimensional points. 335-362 - Hong Yan, John N. Hooker:
Tight representation of logical constraints as cardinality rules. 363-377 - Marco Locatelli, Fabio Schoen:
Random Linkage: a family of acceptance/rejection algorithms for global optimisation. 379-396 - Adam B. Levy:
Stability of solutions to parameterized nonlinear complementarity problems. 397-406 - Paolo Carraresi, Fernanda Farinaccio, Federico Malucelli:
Testing optimality for quadratic 0-1 problems. 407-421 - A. J. Federowicz, Jayant Rajgopal:
Robustness of posynomial geometric programming optima. 423-431 - Nicholas I. M. Gould, Philippe L. Toint:
A note on the convergence of barrier algorithms to second-order necessary points. 433-438
Volume 85, Number 3, August 1999
- Zonghao Gu, George L. Nemhauser, Martin W. P. Savelsbergh:
Lifted flow cover inequalities for mixed 0-1 integer programs. 439-467 - Andrzej Cegielski:
A method of projection onto an acute cone with level control in convex minimization. 469-490 - Thomas F. Coleman, Jianguo Liu:
An interior Newton method for quadratic programming. 491-523 - Madhu V. Nayakkankuppam, Michael L. Overton:
Conditioning of semidefinite programs. 525-540 - J. M. van den Akker, C. P. M. van Hoesel, Martin W. P. Savelsbergh:
A polyhedral approach to single-machine scheduling problems. 541-572 - Charles Audet, Pierre Hansen, Brigitte Jaumard, Gilles Savard:
A symmetrical linear maxmin approach to disjoint bilinear programming. 573-592 - Marco Locatelli:
Finiteness of conical algorithms with ω-subdivisions. 593-616 - Josef Haberl:
Fixed-charge continuous knapsack problems and pseudogreedy solutions. 617-642 - Martin Gugat:
A parametric view on the Mangasarian-Fromovitz constraint qualification. 643-653
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 2024-12-19 22:15 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:
