default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDMathematical Programming, Volume 93
Volume 93, Number 1, June 2002
- Andreas Griewank
, Christo Mitev:
Detecting Jacobian sparsity patterns by Bayesian probing. 1-25 - Bernard Fortz, Martine Labbé:
Polyhedral results for two-connected networks with bounded rings. 27-54 - Javier Peña:
Two properties of condition numbers for convex programs via implicitly defined barrier functions. 55-75 - Giovanni Rinaldi, Ulrich Voigt, Gerhard J. Woeginger:
The mathematics of playing golf, or: a new class of difficult non-linear mixed integer programs. 77-86 - Felipe Alvarez, Roberto Cominetti:
Primal and dual convergence of a proximal point exponential penalty method for linear programming. 87-96 - Samuel Burer, Renato D. C. Monteiro, Yin Zhang:
Solving a class of semidefinite programs via nonlinear programming. 97-122 - Gérard Cornuéjols, Yanjun Li:
A connection between cutting plane theory and the geometry of numbers. 123-127 - Jiming Peng, Cornelis Roos, Tamás Terlaky:
Self-regular functions and new search directions for linear and semidefinite optimization. 129-171
Volume 93, Number 2, December 2002
- Christoph Helmberg, Krzysztof C. Kiwiel:
A spectral bundle method with bounds. 173-194 - Andrzej Ruszczynski:
Probabilistic programming with discrete distributions and precedence constrained knapsack polyhedra. 195-215 - Paul Tseng, Yinyu Ye:
On some interior-point algorithms for nonconvex quadratic optimization. 217-225 - Donald Goldfarb, Yiqing Lin:
Combinatorial interior point methods for generalized network flow problems. 227-246 - Mohit Tawarmalani, Nikolaos V. Sahinidis:
Convex extensions and envelopes of lower semi-continuous functions. 247-263 - Xinmin Hu, Daniel Ralph:
A note on sensitivity of value functions of mathematical programs with complementarity constraints. 265-279 - Emilio Carrizosa, Jörg Fliege:
Generalized Goal Programming: polynomial methods and applications. 281-303 - Faranak Sharifi Mokhtarian, Jean-Louis Goffin:
An analytic center quadratic cut method for the convex quadratic feasibility problem. 305-325 - Lázaro Cánovas, Roberto Cañavate, Alfredo Marín:
On the convergence of the Weiszfeld algorithm. 327-330
Volume 93, Number 3, December 2002
- Brien Alkire, Lieven Vandenberghe:
Convex optimization problems involving finite autocorrelation sequences. 331-359 - José Niño-Mora:
Dynamic allocation indices for restless projects and queueing admission control: a polyhedral approach. 361-413 - Malcolm Craig Pullan:
An extended algorithm for separated continuous linear programs. 415-451 - Fabián Flores Bazán:
Ideal, weakly efficient solutions for vector optimization problems. 453-475 - Hamish Waterer, Ellis L. Johnson, Paolo Nobili, Martin W. P. Savelsbergh:
The relation of time indexed formulations of single machine scheduling problems to the node packing problem. 477-494 - Antonio J. Conejo, Francisco J. Nogales, Francisco J. Prieto:
A decomposition procedure based on approximate Newton directions. 495-515
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-11 21:17 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:
