Volume 80, 1998
- Imre Bárány, Herbert E. Scarf, David Shallcross:
The topological structure of maximal lattice free convex bodies: The general case.
1-15
- Ronald D. Armstrong, Wei Chen, Donald Goldfarb, Zhiying Jin:
Strongly polynomial dual simplex methods for the maximum flow problem.
17-33
- Michael C. Ferris, Jeffrey D. Horn:
Partitioning mathematical programs for parallel solution.
35-61
- Dimitris Bertsimas, Rakesh V. Vohra:
Rounding algorithms for covering problems.
63-89
- Jorge R. Vera:
On the complexity of linear programming under finite precision arithmetic.
91-123
- Masakazu Kojima, Masayuki Shida, Susumu Shindoh:
Local convergence of predictor-corrector infeasible-interior-point algorithms for SDPs and SDLCPs.
129-160
- Stephen M. Robinson:
A reduction method for variational inequalities.
161-169
- Arie Tamir, Joseph S. B. Mitchell:
A maximum b-matching problem arising from median location models with applications to the roommates problem.
171-194
- Yinyu Ye:
On the complexity of approximating a KKT point of quadratic programming.
195-211
- Giorgio Gallo, Claudio Gentile, Daniele Pretolani, Gabriella Rago:
Max Horn SAT and the minimum cut problem in directed hypergraphs.
213-237
- Igor V. Konnov:
A combined relaxation method for variational inequalities with nonlinear constraints.
239-252
- Noga Alon, Nabil Kahale:
Approximating the independence number via the theta-function.
253-264
- Paolo Nobili, Antonio Sassano:
(0, +-1) ideal matrices.
265-281
- Renato D. C. Monteiro, Yanhui Wang:
Trust region affine scaling algorithms for linearly constrained convex and concave programs.
283-313
- Andrew R. Conn, Marcel Mongeau:
Discontinuous piecewise linear optimization.
315-380
Last update Thu May 23 19:16:54 2013
CET by the DBLP Team — 
Data released under the ODC-BY 1.0 license — See also our legal information page
