default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDMathematical Programming, Volume 106
Volume 106, Number 1, May 2006
- Kevin K. H. Cheung, William H. Cunningham, Lawrence Tang:
Optimal 3-terminal cuts and linear programming. 1-23 - Andreas Wächter, Lorenz T. Biegler
:
On the implementation of an interior-point filter line-search algorithm for large-scale nonlinear programming. 25-57 - Wen Song, Rui Zang:
Bounded linear regularity of convex sets in Banach spaces and its applications. 59-79 - V. Jeyakumar:
The strong conical hull intersection property for convex programming. 81-92 - Dorina Jibetean, Etienne de Klerk:
Global optimization of rational functions: a semidefinite programming approach. 93-109 - Sanjeeb Dash, Oktay Günlük:
Valid inequalities based on the interpolation procedure. 111-136 - Mabel C. Chou, Maurice Queyranne, David Simchi-Levi:
The asymptotic performance ratio of an on-line algorithm for uniform parallel machine scheduling with release dates. 137-157 - Monia Giandomenico, Adam N. Letchford:
Exploring the Relationship Between Max-Cut and Stable Set Relaxations. 159-175 - Xin Chen, Houduo Qi:
Cartesian P-property and Its Applications to the Semidefinite Linear Complementarity Problem. 177-201
Volume 106, Number 2, June 2006
- Suvrajeet Sen, Hanif D. Sherali:
Decomposition with branch-and-cut approaches for two-stage stochastic mixed-integer programming. 203-223 - Antonio Frangioni, Claudio Gentile:
Perspective cuts for a class of convex 0-1 mixed integer programs. 225-236 - Igor Griva, Roman A. Polyak:
Primal-dual nonlinear rescaling method with dynamic scaling parameter update. 237-259 - Ted K. Ralphs, Matthew V. Galati:
Decomposition and Dynamic Cut Generation in Integer Linear Programming. 261-285 - Mihály Csaba Markót, José Fernández, Leocadio G. Casado, Tibor Csendes:
New interval methods for constrained global optimization. 287-318 - Hemanshu Kaul, Sheldon H. Jacobson:
Global optima results for the Kauffman NK model. 319-338 - Yinyu Ye:
Improved complexity results on solving real-number linear feasibility problems. 339-363 - Hande Yaman:
Formulations and Valid Inequalities for the Heterogeneous Vehicle Routing Problem. 365-390 - Ilan Adler, Richard W. Cottle, Sushil Verma:
Sufficient matrices belong to L. 391-401
Volume 106, Number 3, July 2006
- Yu-Hong Dai, Roger Fletcher:
New algorithms for singly linearly constrained quadratic programs subject to lower and upper bounds. 403-421 - Martin E. Dyer, Leen Stougie:
Computational complexity of stochastic programming problems. 423-432 - Shabbir Ahmed:
Convexity and decomposition of mean-risk stochastic programs. 433-446 - Gerhard Reinelt, Dirk Oliver Theis:
A note on the Undirected Rural Postman Problem polytope. 447-452 - Sergei Chubanov, Mikhail Y. Kovalyov, Erwin Pesch:
An FPTAS for a single-item capacitated economic lot-sizing problem with monotone cost structure. 453-466 - Alexandre d'Aspremont, Laurent El Ghaoui:
Static arbitrage bounds on basket option prices. 467-489 - Ricardo Fukasawa, Humberto J. Longo, Jens Lysgaard, Marcus Poggi de Aragão, Marcelo L. Reis, Eduardo Uchoa, Renato Fonseca F. Werneck:
Robust Branch-and-Cut-and-Price for the Capacitated Vehicle Routing Problem. 491-511 - Xiaojun Chen, Shuhuang Xiang:
Computation of Error Bounds for P-matrix Linear Complementarity Problems. 513-525 - Robert M. Freund:
On the behavior of the homogeneous self-dual model for conic convex optimization. 527-545 - Klaus Jansen:
An approximation algorithm for the general max-min resource sharing problem. 547-566 - Gérard Cornuéjols, Claude Lemaréchal:
A convex-analysis perspective on disjunctive cuts. 567-586 - Jiawang Nie, James Demmel, Bernd Sturmfels:
Minimizing Polynomials via Sum of Squares over the Gradient Ideal. 587-606
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 2025-01-26 23:52 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:
