Stop the war!Остановите войну!
for scientists:
default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDMathematical Programming, Volume 135
Volume 135, Numbers 1-2, October 2012
- Michel X. Goemans, Satoru Iwata, Rico Zenklusen:
A flow model based on polylinking system. 1-23 - Yusuke Kobayashi, Kazuo Murota, Robert Weismantel:
Cone superadditivity of discrete convex functions. 25-44 - Agostinho Agra
, Miguel Fragoso Constantino:
Mixing polyhedra with two non divisible coefficients. 45-87 - Hiroshi Yamashita, Hiroshi Yabe, Kouhei Harada:
A primal-dual interior point method for nonlinear semidefinite programming. 89-121 - Yuk Hei Chan, Lap Chi Lau:
On linear and semidefinite programming relaxations for hypergraph matching. 123-148 - Zhaosong Lu, Yong Zhang:
An augmented Lagrangian approach for sparse principal component analysis. 149-193 - Zdenek Dostál, Tomás Kozubek:
An optimal algorithm and superrelaxation for minimization of a quadratic function subject to separable convex constraints with applications. 195-220 - Sanjeeb Dash, Santanu S. Dey, Oktay Günlük:
Two dimensional lattice-free cuts and asymmetric disjunctions for mixed-integer polyhedra. 221-254 - Roberto Andreani, Gabriel Haeser, María Laura Schuverdt, Paulo J. S. Silva:
A relaxed constant positive linear dependence constraint qualification and applications. 255-273 - Amir Ali Ahmadi, Pablo A. Parrilo:
A convex polynomial that is not sos-convex. 275-292 - Johannes O. Royset:
Optimality functions in stochastic programming. 293-321 - Kevin Buchin, Jirí Matousek, Robin A. Moser, Dömötör Pálvölgyi:
Vectors in a box. 323-335 - Frieda Granot, S. Thomas McCormick, Maurice Queyranne, Fabio Tardella:
Structural and algorithmic properties for parametric minimum cuts. 337-367 - Christoph Buchheim, Alberto Caprara, Andrea Lodi:
An effective branch-and-bound algorithm for convex quadratic integer programming. 369-395 - Alberto Del Pia, Robert Weismantel:
On convergence in mixed integer programming. 397-412 - Roger Fletcher:
A limited memory steepest descent method. 413-436 - Wolfram Wiesemann, Daniel Kuhn, Berç Rustem:
Robust resource allocations in temporal networks. 437-471 - Felipe Alvarez, Jérôme Bolte, J. Frédéric Bonnans, Francisco J. Silva:
Asymptotic expansions for interior penalty solutions of control constrained linear-quadratic problems. 473-507 - Egon Balas, Matteo Fischetti, Arrigo Zanette:
A hard integer program made easy by lexicography. 509-514
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-05-15 21:36 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:
