default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDMathematical Programming, Volume 86
Volume 86, Number 1, September 1999
- Claus Wallacher, Uwe T. Zimmermann:
A polynomial cycle canceling algorithm for submodular flows. 1-15 - Oktay Günlük
:
A branch-and-cut algorithm for capacitated network design problems. 17-39 - Stephen M. Robinson:
Linear convergence of epsilon-subgradient descent methods for a class of convex functions. 41-50 - Geoffrey Pritchard, Golbon Zakeri:
Upper bounds for Gaussian stochastic programs. 51-63 - Jonathan Eckstein, Michael C. Ferris:
Smooth methods of multipliers for complementarity problems. 65-90 - Song Xu, James V. Burke:
A polynomial time interior-point path-following algorithm for LCP based on Chen-Harker-Kanzow smoothing techniques. 91-103 - Keisuke Hotta, Akiko Yoshise:
Global convergence of a class of non-interior point algorithms using Chen-Harker-Kanzow-Smale functions for nonlinear complementarity problems. 105-133 - Heinz H. Bauschke, Jonathan M. Borwein, Wu Li:
Strong conical hull intersection property, bounded linear regularity, Jameson's property (G), and error bounds in convex optimization. 135-160 - Robert L. M. J. van de Leensel, C. P. M. van Hoesel, Joris van de Klundert:
Lifting valid inequalities for the precedence constrained knapsack problem. 161-185 - Xin Chen, Ya-Xiang Yuan:
A note on quadratic forms. 187-197 - Bingsheng He:
Inexact implicit methods for monotone general variational inequalities. 199-217 - Levent Tunçel:
Approximating the complexity measure of Vavasis-Ye algorithm is NP-hard. 219-223
Volume 86, Number 2, November 1999
- Robert M. Freund, Jorge R. Vera:
Some characterizations and properties of the "distance to ill-posedness" and the condition measure of a conic linear system. 225-260 - Arjan Berkelaar, Benjamin Jansen, Kees Roos, Tamás Terlaky:
Basis- and partition identification for quadratic programming and linear complementarity problems. 261-282 - Torbjörn Larsson, Michael Patriksson, Ann-Brith Strömberg:
Ergodic, primal convergence in dual subgradient schemes for convex programming. 283-312 - Reha H. Tütüncü:
An infeasible-interior-point potential-reduction algorithm for linear programming. 313-334 - Cécile Cordier, Hugues Marchand, Richard Laundy, Laurence A. Wolsey:
bc - opt : a branch-and-cut code for mixed integer programs. 335-353 - Daniel Granot, Herbert Hamers, Stef Tijs:
On some balanced, totally balanced and submodular delivery games. 355-366 - Ji-Ming Peng, Masao Fukushima:
A hybrid Newton method for solving the variational inequality problem via the D-gap function. 367-386 - Jan-J. Rückmann:
On existence and uniqueness of stationary points in semi-infinite optimization. 387-415 - Xiaotie Deng, Christos H. Papadimitriou:
Decision-making by hierarchies of discordant agents. 417-431 - Aris Daniilidis, Nicolas Hadjisavvas:
Coercivity conditions and variational inequalities. 433-438 - Adam B. Levy:
Errata in implicit multifunction theorems for the sensitivity analysis of variational conditions. 439-441
Volume 86, Number 3, December 1999
- László Lovász:
Hit-and-run mixes fast. 443-461 - Arkadi Nemirovski, Cornelis Roos, Tamás Terlaky:
On maximization of quadratic form over intersection of ellipsoids with common center. 463-473 - Michael C. Ferris, Christian Kanzow, Todd S. Munson:
Feasible descent algorithms for mixed complementarity problems. 475-497 - Sylvia C. Boyd, Robert Carr:
A new bound for the ratio between the 2-matching problem and its linear programming relaxation. 499-514 - Robert A. Stubbs, Sanjay Mehrotra:
A branch-and-cut method for 0-1 mixed convex programming. 515-532 - Ji-Ming Peng, Zheng-Hua Lin:
A non-interior continuation method for generalized linear complementarity problems. 533-563 - François Vanderbeck:
Computational study of a column generation algorithm for bin packing and cutting stock problems. 565-594 - Sebastián Ceria, João Soares:
Convex programming for disjunctive convex optimization. 595-614 - Matthias Heinkenschloss, Michael Ulbrich, Stefan Ulbrich:
Superlinear and quadratic convergence of affine-scaling interior-point Newton methods for problems with simple bounds without strict complementarity assumption. 615-635 - S. R. Mohan, S. K. Neogy, T. Parthasarathy, S. Sinha:
Vertical linear complementarity and discounted zero-sum stochastic games with ARAT structure. 637-648 - Walter Gómez Bofill:
Properties of an interior embedding for solving nonlinear optimization problems. 649-659
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-20 23:48 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:
