- Zhaosong Lu. A computational study on robust portfolio selection based on a joint ellipsoidal uncertainty set. Math. Program., 126(1):193-201, 2011.
- Patrick D. Mackin, Asim Roy, Jyrki Wallenius. An interactive weight space reduction procedure for nonlinear multiple objective mathematical programming. Math. Program., 127(2):425-444, 2011.
- Xi Yin Zheng, Kung Fu Ng. Strong KKT conditions and weak sharp solutions in convex-composite optimization. Math. Program., 126(2):259-279, 2011.
- Daya Ram Gaur, Ramesh Krishnamurti, Rajeev Kohli. Erratum to: The capacitated max ::::k::::-cut problem. Math. Program., 126(1):191, 2011.
- Guanghui Lan, Zhaosong Lu, Renato D. C. Monteiro. Primal-dual first-order methods with ::::O::::(1/e) iteration-complexity for cone programming. Math. Program., 126(1):1-29, 2011.
- Gábor Rudolf, Nilay Noyan, Dávid Papp, Farid Alizadeh. Bilinear optimality constraints for the cone of positive polynomials. Math. Program., 129(1):5-31, 2011.
- Toshihide Ibaraki, Takashi Imamichi, Yuichi Koga, Hiroshi Nagamochi, Koji Nonobe, Mutsunori Yagiura. Efficient branch-and-bound algorithms for weighted MAX-2-SAT. Math. Program., 127(2):297-343, 2011.
- Martin K. Bernauer, Roland Griesse. A robustification approach in unconstrained quadratic optimization. Math. Program., 128(1-2):231-252, 2011.
- Luigi Grippo, Laura Palagi, Veronica Piccialli. An unconstrained minimization method for solving low-rank SDP relaxations of the maxcut problem. Math. Program., 126(1):119-146, 2011.
- Amitabh Basu, Pierre Bonami, Gérard Cornuéjols, François Margot. On the relative strength of split, triangle and quadrilateral cuts. Math. Program., 126(2):281-314, 2011.