Volume 81,
1998
- Michael J. Todd, Yinyu Ye:
Approximate Farkas lemmas and stopping rules for iterative infeasible-point algorithms for linear programming.
1-21
- Ya. I. Alber, Alfredo N. Iusem, Mikhail V. Solodov:
On the projected subgradient method for nonsmooth convex optimization in a Hilbert space.
23-35
- Geir Dahl, François Margot:
Weak k-majorization and polyhedra.
37-53
- Osman Güler, Levent Tunçel:
Characterization of the barrier parameter of homogeneous convex cones.
55-76
- Jos F. Sturm, Shuzhong Zhang:
An interior point method, based on rank-1 updates, for linear programming.
77-87
- D. W. Bulger, G. R. Wood:
Hesitant adaptive search for global optimisation.
89-102
- Christian Kanzow, Houyuan Jiang:
A continuation method for (strongly) monotone variational inequalities.
103-125
- Yaroslav D. Sergeyev:
Global one-dimensional optimization using smooth auxiliary functions.
127-146
- Karen Aardal:
Capacitated facility location: Separation algorithms and computational experience.
149-175
- Daniel Bienstock, Sunil Chopra, Oktay Günlük, Chih-Yang Tsai:
Minimum cost capacity installation for multicommodity network flows.
177-199
- Sebastián Ceria, Cécile Cordier, Hugues Marchand, Laurence A. Wolsey:
Cutting planes for integer programs with general integer variables.
201-214
- Sebastián Ceria, Paolo Nobili, Antonio Sassano:
A Lagrangian-based heuristic for large-scale set covering problems.
215-228
- Carlos Eduardo Ferreira, Alexander Martin, C. Carvalho de Souza, Robert Weismantel, Laurence A. Wolsey:
The node capacitated graph partitioning problem: A computational study.
229-256
- Xiao-Qing Yan, E. Andrew Boyd:
Cutting planes for mixed-integer knapsack polyhedra.
257-262
- Charu C. Aggarwal, Ravindra K. Ahuja, Jianxiu Hao, James B. Orlin:
Diagnosing infeasibilities in network flow problems.
263-280
- Renato D. C. Monteiro, Yin Zhang:
A unified analysis for a class of long-step primal-dual path-following interior-point algorithms for semidefinite programming.
281-299
- Alexander Shapiro, Tito Homem-de-Mello:
A simulation-based approach to two-stage stochastic programming with recourse.
301-325
- Xiaoqi Yang:
Second-order global optimality conditions for convex composite optimization.
327-347
- Gert A. Tijssen, Gerard Sierksma:
Balinski-Tucker simplex tableaus: Dimensions, degeneracy degrees, and interior points of optimal faces.
349-372
- Yair Censor, Alfredo N. Iusem, Stavros A. Zenios:
An interior point method with Bregman functions for the variational inequality problem with paramonotone operators.
373-400
- Susana Scheimberg, Patricia Erthal de Moraes:
Note on a sufficient condition for a local minimum of a class of nonconvex quadratic programs.
401-405
Last update Tue Feb 14 03:38:25 2012
CET by the DBLP Team — 
Data released under the ODC-BY 1.0 license — See also our legal information page
