default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDMathematical Programming, Volume 80
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 Kahalé:
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
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 2026-07-11 00:11 CEST 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, funded, and maintained by:
Schloss Dagstuhl - Leibniz Center for Informatics is a member of the Leibniz Association and is funded by the federal government of Germany and the states of Germany, especially Saarland and Rhineland‑Palatinate.
