


default search action
Mathematical Programming, Volume 113
Volume 113, Number 1, May 2008
- Antoine Deza, Eissa Nematollahi, Tamás Terlaky

:
How good are interior point methods? Klee-Minty cubes tighten iteration-complexity bounds. 1-14 - Quentin Louveaux, Robert Weismantel:

Polyhedral properties for the intersection of two knapsacks. 15-37 - Fumei Lam, Alantha Newman:

Traveling salesman path problems. 39-59 - Daniel Kuhn:

Aggregation and discretization in multistage stochastic programming. 61-94 - José R. Rodríguez-Mancilla, William T. Ziemba:

The duality of option investment strategies for hedge funds. 95-131 - Vincent Acary

, Bernard Brogliato, Daniel Goeleven:
Higher order Moreau's sweeping process: mathematical formulation and numerical simulation. 133-217
Volume 113, Number 2, June 2008
- Egon Balas, Anureet Saxena:

Optimizing over the split closure. 219-240 - Pierre Bonami, Gérard Cornuéjols, Sanjeeb Dash, Matteo Fischetti, Andrea Lodi:

Projected Chvátal-Gomory cuts for mixed integer linear programs. 241-257 - Samuel Burer, Dieter Vandenbussche:

A finite branch-and-bound algorithm for nonconvex quadratic programming via semidefinite relaxations. 259-282 - Dusan Bednarík, Karel Pastor:

On second-order conditions in unconstrained optimization. 283-298 - Olivier Briant

, Claude Lemaréchal, Philippe Meurdesoif, S. Michel, Nancy Perrot
, François Vanderbeck:
Comparison of bundle and classical column generation. 299-344 - Jong-Shi Pang, David E. Stewart

:
Differential variational inequalities. 345-424

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.


Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCID














