default search action
Mathematical Programming, Volume 89
Volume 89, Number 1, November 2000
- François Oustry:
A second-order bundle method to minimize the maximum eigenvalue function. 1-33 - Alper Atamtürk, George L. Nemhauser, Martin W. P. Savelsbergh:
The mixed vertex packing problem. 35-53 - Darinka Dentcheva, András Prékopa, Andrzej Ruszczynski:
Concavity and efficient points of discrete distributions in probabilistic programming. 55-77 - Masakazu Kojima, Levent Tunçel:
Discretization and localization in successive convex relaxation methods for nonconvex quadratic optimization. 79-111 - Gérard Cornuéjols, Bertrand Guenin, François Margot:
The packing property. 113-126 - Daniel Bienstock, Gabriella Muratore:
Strong inequalities for capacitated survivable network design problems. 127-147 - Richard H. Byrd, Jean Charles Gilbert
, Jorge Nocedal:
A trust region method based on interior point techniques for nonlinear programming. 149-185 - Ismael R. de Farias Jr., Ellis L. Johnson, George L. Nemhauser:
A generalized assignment problem with special ordered sets: a polyhedral approach. 187-203
Volume 89, Number 2, January 2001
- John M. Mulvey:
Introduction to financial optimization: Mathematical Programming Special Issue. 205-216 - Wlodzimierz Ogryczak
On consistency of stochastic dominance and mean-semideviation models. 217-232 - Hiroshi Konno, Annista Wijayanayake
Portfolio optimization problem under concave transaction costs and minimal transaction unit constraints. 233-250 - Georg Ch. Pflug:
Scenario tree generation for multiperiod financial optimization by optimal discretization. 251-271 - Fredrik Andersson, Helmut Mausser, Dan Rosen, Stanislav Uryasev
Credit risk optimization with Conditional Value-at-Risk criterion. 273-291 - Yonggan Zhao, William T. Ziemba:
A stochastic programming model using an endogenously determined worst case risk measure for dynamic asset allocation. 293-309 - Andrea Consiglio, Stavros A. Zenios
Integrated simulation and optimization models for tracking international fixed income indices. 311-339
Volume 89, Number 3, February 2001
- Kurt M. Anstreicher, Nathan W. Brixius
A new bound for the quadratic assignment problem based on convex quadratic programming. 341-357 - John J. Clifford, Marc E. Posner:
Parallel machine scheduling with high multiplicity. 359-383 - Hoang Xuan Phu, Nguyen Dong Yen:
On the stability of solutions to quadratic programming problems. 385-394 - Pasquale Avella, Antonio Sassano:
On the p -Median polytope. 395-411 - Alexey F. Izmailov, Mikhail V. Solodov:
Error bounds for 2-regular mappings with Lipschitzian derivatives and their applications. 413-435 - Jonathan H. Owen, Sanjay Mehrotra:
A disjunctive cutting plane procedure for general mixed-integer linear programs. 437-448 - Gábor Pataki, Levent Tunçel:
On the generic properties of convex optimization problems in conic form. 449-457 - Hanif D. Sherali, Hongjie Wang:
Global optimization of nonconvex factorable programming problems. 459-478 - Graham R. Wood, Zelda B. Zabinsky, Birna P. Kristinsdottir:
Hesitant adaptive search: the distribution of the number of iterations to convergence. 479-486 - Marko Loparic, Yves Pochet, Laurence A. Wolsey:
The uncapacitated lot-sizing problem with sales and safety stocks. 487-504 - Pierre Maréchal:
On the convexity of the multiplicative potential and penalty functions and related topics. 505-516 - Shinji Mizuno, Michael J. Todd:
On two homogeneous self-dual approaches to linear programming and its extensions. 517-534
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 2024-11-25 22:33 CET 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 and maintained by:
the dblp computer science bibliography is funded and supported by: