default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDMathematical Programming, Volume 126
Volume 126, Number 1, January 2011
- Guanghui Lan, Zhaosong Lu
, Renato D. C. Monteiro:
Primal-dual first-order methods with O(1/e) iteration-complexity for cone programming. 1-29 - Khalid Addi, Bernard Brogliato, Daniel Goeleven:
A qualitative mathematical analysis of a class of linear variational inequalities via semi-complementarity problems: applications in electronics. 31-67 - Thomas C. Sharkey, H. Edwin Romeijn, Joseph Geunes:
A class of nonlinear nonseparable continuous knapsack and multiple-choice knapsack problems. 69-96 - Raymond Hemmecke, Shmuel Onn, Robert Weismantel:
A polynomial oracle-time algorithm for convex integer minimization. 97-117 - Luigi Grippo, Laura Palagi, Veronica Piccialli:
An unconstrained minimization method for solving low-rank SDP relaxations of the maxcut problem. 119-146 - James Ostrowski, Jeff T. Linderoth, Fabrizio Rossi, Stefano Smriglio:
Orbital branching. 147-178 - Ralf Gollmer, Uwe Gotzes, Rüdiger Schultz:
A note on second-order stochastic dominance constraints induced by mixed-integer linear recourse. 179-190 - Daya Ram Gaur, Ramesh Krishnamurti, Rajeev Kohli:
Erratum to: The capacitated max k-cut problem. 191 - Zhaosong Lu:
A computational study on robust portfolio selection based on a joint ellipsoidal uncertainty set. 193-201
Volume 126, Number 2, February 2011
- Gennadiy Averkov, Martin Henk:
Representing simple d-dimensional polytopes by d polynomials. 203-230 - Alexey F. Izmailov, Mikhail V. Solodov:
On attraction of linearly constrained Lagrangian methods and of stabilized and quasi-Newton SQP methods to critical multipliers. 231-257 - Xi Yin Zheng, Kung Fu Ng:
Strong KKT conditions and weak sharp solutions in convex-composite optimization. 259-279 - Amitabh Basu, Pierre Bonami, Gérard Cornuéjols, François Margot:
On the relative strength of split, triangle and quadrilateral cuts. 281-314 - John Dunagan, Daniel A. Spielman, Shang-Hua Teng:
Smoothed analysis of condition numbers and complexity implications for linear programming. 315-350 - Alper Atamtürk, Vishnu Narayanan:
Lifting for conic mixed-integer programming. 351-363 - Shu Lu:
Implications of the constant rank constraint qualification. 365-392 - Vaithilingam Jeyakumar, Guoyin Li:
Necessary global optimality conditions for nonlinear programming problems with polynomial constraints. 393-399 - Vineet Goyal, Latife Genç Kaya, R. Ravi:
An FPTAS for minimizing the product of two non-negative linear cost functions. 401-405
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-12-19 22:15 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:
