default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDMathematical Programming, Volume 100
Volume 100, Number 1, May 2004
- Nick I. M. Gould
, Sven Leyffer, Philippe L. Toint:
Nonlinear programming: theory and practice. 1-2 - Mark A. Abramson, Charles Audet, John E. Dennis Jr.:
Generalized pattern searches with derivative information. 3-25 - Richard H. Byrd, Nicholas I. M. Gould, Jorge Nocedal, Richard A. Waltz:
An algorithm for nonlinear optimization using linear programming and equality constrained subproblems. 27-48 - E. Michael Gertz, Philip E. Gill:
A primal-dual trust region algorithm for nonlinear optimization. 49-94 - Nick I. M. Gould, Philippe L. Toint:
Preprocessing for quadratic programming. 95-132 - J. A. J. Hall, K. I. M. McKinnon:
The simplest examples where the simplex method cycles and conditions where expand fails to prevent cycling. 133-150 - Jorge J. Moré, Todd S. Munson:
Computing mountain passes and transition states. 151-182 - M. J. D. Powell:
Least Frobenius norm updating of quadratic models that satisfy interpolation conditions. 183-215 - Stefan Ulbrich:
On the superlinear local convergence of a filter-SQP method. 217-245
Volume 100, Number 2, June 2004
- Frank Plastria, Emilio Carrizosa:
Optimal location and design of a competitive facility. 247-265 - Samir Elhedhli, Jean-Louis Goffin:
The integration of an interior-point cutting plane method within a branch-and-price algorithm. 267-294 - Van-Anh Truong, Levent Tunçel:
Geometry of homogeneous convex cones, duality mapping, and optimal self-concordant barriers. 295-316 - Florian A. Potra:
A superlinearly convergent predictor-corrector method for degenerate LCP in a wide neighborhood of the central path with -iteration complexity. 317-337 - S. R. Mohan, S. K. Neogy, A. K. Das:
A note on linear complementarity problems and multiple objective programming. 339-344 - Eduardo Conde:
An improved algorithm for selecting p items with uncertain returns according to the minmax-regret criterion. 345-353 - Shabbir Ahmed, Mohit Tawarmalani, Nikolaos V. Sahinidis:
A finite branch-and-bound algorithm for two-stage stochastic integer programs. 355-377 - Michael Ulbrich, Stefan Ulbrich, Luís Nunes Vicente:
A globally convergent primal-dual interior-point filter method for nonlinear programming. 379-410 - Fabián A. Chudak, Tim Roughgarden, David P. Williamson:
Approximate k-MSTs and k-Steiner trees via the primal-dual method and Lagrangean relaxation. 411-421 - Jens Lysgaard, Adam N. Letchford, Richard W. Eglese:
A new branch-and-cut algorithm for the capacitated vehicle routing problem. 423-445
Volume 100, Number 3, July 2004
- E. Michael Gertz:
A quasi-Newton trust-region method. 447-470 - S. J. Gismondi, E. R. Swart:
A model of the coNP-complete non-Hamilton tour decision problem for directed graphs. 471-483 - Aram V. Arutyunov, Alexey F. Izmailov:
Abnormal equality-constrained optimization problems: sensitivity theory. 485-515 - Padmanaban Kesavan, Russell J. Allgor, Edward P. Gatzke, Paul I. Barton:
Outer approximation algorithms for separable nonconvex mixed-integer nonlinear programs. 517-535 - Andrew V. Goldberg, Alexander V. Karzanov:
Maximum skew-symmetric flows and matchings. 537-568 - Robert D. Carr, Santosh S. Vempala:
On the Held-Karp relaxation for the asymmetric and symmetric traveling salesman problems. 569-587 - René Henrion, Werner Römisch:
Hölder and Lipschitz stability of solution sets in programs with probabilistic constraints. 589-611 - Kurt M. Anstreicher:
The volumetric barrier for convex quadratic constraints. 613-662
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-04 20:03 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:
