Stop the war!Остановите войну!
for scientists:
default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDMathematical Programming, Volume 130
Volume 130, Number 1, November 2011
- Deeparnab Chakrabarty, Nikhil R. Devanur, Vijay V. Vazirani:
New geometry-inspired relaxations and algorithms for the metric Steiner tree problem. 1-32 - Csaba I. Fábián, Gautam Mitra, Diana Roman
:
Processing second-order stochastic dominance models using cutting-plane representations. 33-57 - Krzysztof C. Kiwiel:
An alternating linearization bundle method for convex optimization and nonlinear multicommodity flow problems. 59-84 - Joseph Geunes, Retsef Levi, H. Edwin Romeijn, David B. Shmoys:
Approximation algorithms for supply chain planning and logistics problems with market choice. 85-106 - Santanu S. Dey:
A note on the split rank of intersection cuts. 107-124 - Anthony Man-Cho So:
Moment inequalities for sums of random matrices and their applications in optimization. 125-151 - Arrigo Zanette, Matteo Fischetti, Egon Balas:
Lexicography and degeneracy: can a pure cutting plane algorithm work? 153-176 - Daniel Kuhn, Wolfram Wiesemann, Angelos Georghiou:
Primal and dual linear decision rules in stochastic and robust optimization. 177-209 - Roberto Andreani, Joaquim João Júdice, José Mario Martínez, João Patrício:
On the natural merit function for solving complementarity problems. 211-223
Volume 130, Number 2, December 2011
- Gérard Cornuéjols, Leo Liberti, Giacomo Nannicini:
Improved strategies for branching on general disjunctions. 225-247 - François Vanderbeck:
Branching in branch-and-price: a generic scheme. 249-294 - Coralia Cartis, Nicholas I. M. Gould, Philippe L. Toint:
Adaptive cubic regularisation methods for unconstrained optimization. Part II: worst-case function- and derivative-evaluation complexity. 295-319 - Ting Kei Pong, Paul Tseng:
(Robust) Edge-based semidefinite programming relaxation of sensor network localization. 321-358 - Anureet Saxena, Pierre Bonami, Jon Lee:
Convex relaxations of non-convex mixed integer quadratically constrained programs: projected formulations. 359-413 - Jordi Castro, Jordi Cuesta:
Quadratic regularizations in an interior-point method for primal block-angular problems. 415-445
a service of 
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-04-18 20:20 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 and maintained by:
the dblp computer science bibliography is funded and supported by:
