default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDMathematical Programming, Volume 84
Volume 84, Number 1, January 1999
- Adrian S. Lewis:
Nonsmooth analysis of eigenvalues. 1-24 - Gerard van der Laan, Dolf Talman, Zaifu Yang:
Intersection theorems on polytopes. 25-38 - Renato D. C. Monteiro, Takashi Tsuchiya:
Polynomiality of primal-dual algorithms for semidefinite linear complementarity problems based on the Kojima-Shindoh-Hara family of directions. 39-53 - René Henrion, Werner Römisch:
Metric regularity and quantitative stability in stochastic programs with probabilistic constraints. 55-88 - Jean-Louis Goffin, Jean-Philippe Vial:
Shallow, deep and very deep cuts in the analytic center cutting plane method. 89-103 - Shinji Mizuno, Florian Jarre:
Global and polynomial-time convergence of an infeasible-interior-point algorithm using inexact computation. 105-122 - David A. Andrews, Luís Nunes Vicente:
Characterization of the smoothness and curvature of a marginal function for a trust-region problem. 123-135 - Diethard Klatte, Wu Li:
Asymptotic constraint qualifications and global error bounds for convex inequalities. 137-160 - Francisco A. M. Gomes
, María Cristina Maciel, José Mario Martínez:
Nonlinear programming algorithms using trust regions and augmented Lagrangians with nonmonotone penalty parameters. 161-200 - Bevil Milton Glover, Vaithilingam Jeyakumar, Alexander M. Rubinov:
Dual conditions characterizing optimality for convex multi-objective programs. 201-217
Volume 84, Number 2, February 1999
- Yinyu Ye:
Approximating quadratic programming with bound and quadratic constraints. 219-226 - Yurii E. Nesterov, Michael J. Todd, Yinyu Ye:
Infeasible-start primal-dual methods and infeasibility detectors for nonlinear programming problems. 227-267 - Robert Mifflin, Liqun Qi, Defeng Sun:
Properties of the Moreau-Yosida regularization of a piecewise C2 convex function. 269-281 - Matteo Fischetti, Juan José Salazar:
Models and algorithms for the 2-dimensional cell suppression problem in statistical disclosure control. 283-312 - Gül Gürkan, A. Yonca Özge, Stephen M. Robinson:
Sample-path solution of stochastic variational inequalities. 313-333 - Margaréta Halická:
Analytical properties of the central path at boundary point in linear programming. 335-355 - Stephen J. Wright, Florian Jarre:
The role of linear objective functions in barrier methods. 357-373 - Erling D. Andersen, Yinyu Ye:
On a homogeneous algorithm for the monotone complementarity problem. 375-399 - Huifu Xu:
Set-valued approximations and Newton's methods. 401-420 - Sayuri Koga, Hidefumi Kawasaki:
Legendre-type optimality conditions for a variational problem with inequality state constraints. 421-434 - Jörg Fliege:
A note on "On Pareto optima, the Fermat-Weber problem, and polyhedral gauges". 435-438
Volume 84, Number 3, April 1999
- András Frank:
Connectivity augmentation of networks: structures and algorithms. 439-441 - Eddie Cheng:
Edge-augmentation of hypergraphs. 443-465 - Jørgen Bang-Jensen, Bill Jackson:
Augmenting hypergraphs by edges of size two. 467-481 - András A. Benczúr, András Frank:
Covering symmetric supermodular functions by graphs. 483-503 - Tamás Fleiner, Tibor Jordán:
Coverings and structure of crossing families. 505-518 - Zoltán Szigeti:
Hypergraph connectivity augmentation. 519-527 - Steffen Enni:
A 1-(S, T)-edge-connectivity augmentation algorithm. 529-535 - András Frank, Tibor Jordán:
Directed vertex-connectivity augmentation. 537-553 - Ervin Györi, Tibor Jordán:
How to make a graph four-connected. 555-563 - András Frank:
Increasing the rooted-connectivity of a digraph by one. 565-576 - Eddie Cheng, Tibor Jordán:
Successive edge-connectivity augmentation problems. 577-593 - András A. Benczúr:
Parallel and fast sequential algorithms for undirected edge connectivity augmentation. 595-640
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-11-22 19:45 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:
