default search action
Mathematical Programming, Volume 91
Volume 91, Number 1, October 2001
- Adrian S. Lewis, Hristo S. Sendov:
Self-concordant barriers for hyperbolic means. 1-10 - Sándor P. Fekete, Jörg Schepers:
New classes of fast lower bounds for bin packing problems. 11-31 - Alfred Auslender, Marc Teboulle:
Entropic proximal decomposition methods for convex programs and variational inequalities. 33-47 - Kim Allemand, Komei Fukuda, Thomas M. Liebling, Erich Steiner:
A polynomial case of unconstrained zero-one quadratic optimization. 49-52 - Georg Still:
Discretization in semi-infinite programming: the rate of convergence. 53-69 - Ravindra K. Ahuja, James B. Orlin, Dushyant Sharma:
Multi-exchange neighborhood structures for the capacitated minimum spanning tree problem. 71-97 - Florian A. Potra:
Q-superlinear convergence of the iterates in primal-dual interior-point methods. 99-115 - Mirjam Dür:
Dual bounding procedures lead to convergent Branch-and-Bound algorithms. 117-125 - Kenneth O. Kortanek, Qinghong Zhang:
Perfect duality in semi-infinite and semidefinite programming. 127-144 - Alper Atamtürk, George L. Nemhauser, Martin W. P. Savelsbergh:
Valid inequalities for problems with additive variable upper bounds. 145-162 - Dennis Cheung, Felipe Cucker:
A new condition number for linear programming. 163-174 - Michael Jünger, Volker Kaibel:
Box-inequalities for quadratic assignment polytopes. 175-197 - M. Seetharama Gowda, Yoon J. Song:
Errata: On semidefinite linear complementarity problems. 199-200
Volume 91, Number 2, January 2002
- Elizabeth D. Dolan, Jorge J. Moré:
Benchmarking optimization software with performance profiles. 201-213 - Lisa Fleischer, Kevin D. Wayne:
Fast and simple approximation schemes for generalized flow. 215-238 - Roger Fletcher, Sven Leyffer
:
Nonlinear programming without a penalty function. 239-269 - Donald Goldfarb, Zhiying Jin, Yiqing Lin:
A polynomial dual simplex algorithm for the generalized circulation problem. 271-288 - Marcelo Marazzi, Jorge Nocedal:
Wedge trust region methods for derivative free optimization. 289-305 - Petra Bauer, Jeff T. Linderoth, Martin W. P. Savelsbergh
A branch and cut approach to the cardinality constrained circuit problem. 307-348 - Chong Li, Xinghua Wang:
On convergence of the Gauss-Newton method for convex composite optimization. 349-356 - Alessandro Avenali, Carlo Mannino, Antonio Sassano
Minimizing the span of d -walks to compute optimum frequency assignments. 357-374 - Manuel A. Nunez:
A characterization of ill-posed data instances for convex programming. 375-390 - Gérard Cornuéjols, Yanjun Li:
On the rank of mixed 0, 1 polyhedra. 391-397
Volume 91, Number 3, February 2002
- Andrew R. Conn, F. Bruce Shepherd:
Foreword. 399-400 - Boris T. Polyak:
History of mathematical programming in the USSR: analyzing the phenomenon. 401-416 - Michael J. Todd:
The many facets of linear programming. 417-436 - Alexander Schrijver:
On the history of the transportation and maximum flow problems. 437-445 - David P. Williamson:
The primal-dual method for approximation algorithms. 447-478 - Daniel Bienstock, Olga Raskina:
Asymptotic analysis of the flow deviation method for the maximum concurrent flow problem. 479-492 - Martin Skutella:
Approximating the single source unsplittable min-cost flow problem. 493-514 - William H. Cunningham:
Matching, matroids, and extensions. 515-542 - Alan J. King:
Duality and martingales: a stochastic programming perspective on contingent claims. 543-562 - Kurt M. Anstreicher, Nathan W. Brixius
Solving large quadratic assignment problems on computational grids. 563-588
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-20 20:49 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: