default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDMathematical Programming, Volume 118
Volume 118, Number 1, April 2009
- Mikhail V. Solodov:
Global convergence of an SQP method without boundedness assumptions on any of the iterative sequences. 1-12 - Amir Beck, Marc Teboulle:
A convex optimization approach for minimizing the ratio of indefinite quadratic functions over an ellipsoid. 13-35 - Sylvain Coulonges, Arnaud Pêcher, Annegret K. Wagler:
Characterizing and bounding the imperfection ratio for some classes of graphs. 37-46 - Mateo Restrepo, David P. Williamson:
A simple GAP-canceling algorithm for the generalized maximum flow problem. 47-74 - Alberto Caprara, Michele Monaci
:
Bidimensional packing by bilinear programming. 75-108 - Sebastian Sager, Hans Georg Bock, Gerhard Reinelt:
Direct methods with maximal lower bound for mixed-integer optimal control problems. 109-149 - Simge Küçükyavuz, Yves Pochet:
Uncapacitated lot sizing with backlogging: the convex hull. 151-175 - Krzysztof C. Kiwiel, Claude Lemaréchal:
An inexact bundle variant suited to column generation. 177-206
Volume 118, Number 2, May 2009
- Mihai Anitescu, Dan Negrut, Peter Zapol, Anter El-Azab:
A note on the regularity of reduced models obtained by nonlocal quasi-continuum-like approaches. 207-236 - James B. Orlin:
A faster strongly polynomial time algorithm for submodular function minimization. 237-251 - Jean-Philippe P. Richard, Yanjun Li, Lisa A. Miller:
Valid inequalities for MIPs and group polyhedra from approximate liftings. 253-277 - Alexandre Belloni, Robert M. Freund:
Projective re-normalization for improving the behavior of a homogeneous conic linear system. 279-299 - Liqun Qi, Fei Wang, Yiju Wang:
Z-eigenvalue methods for a global polynomial optimization problem. 301-316 - A. J. J. Talman, Zaifu Yang:
A constructive proof of Ky Fan's coincidence theorem. 317-325 - David E. Stewart:
Uniqueness for solutions of differential complementarity problems. 327-345 - Kazufumi Ito, Karl Kunisch:
On a semi-smooth Newton method and its globalization. 347-370 - Holger Heitsch, Werner Römisch:
Scenario tree modeling for multistage stochastic programs. 371-406
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-20 23:16 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.
