Bin packing with general cost structuresEPSTEIN, Leah; LEVIN, Asaf.Mathematical programming (Print). 2012, Vol 132, Num 1-2, pp 355-391, issn 0025-5610, 37 p.Article

Newton's method for computing a normalized equilibrium in the generalized Nash game through fixed point formulationHEUSINGER, Anna Von; KANZOW, Christian; FUKUSHIMA, Masao et al.Mathematical programming (Print). 2012, Vol 132, Num 1-2, pp 99-123, issn 0025-5610, 25 p.Article

On claw-free t-perfect graphsBRUHN, Henning; STEIN, Maya.Mathematical programming (Print). 2012, Vol 133, Num 1-2, pp 461-480, issn 0025-5610, 20 p.Article

Robust smoothed analysis of a condition number for linear programmingBÜRGISSER, Peter; AMELUNXEN, Dennis.Mathematical programming (Print). 2012, Vol 131, Num 1-2, pp 221-251, issn 0025-5610, 31 p.Article

Tightening simple mixed-integer sets with guaranteed boundsBIENSTOCK, Daniel; MCCLOSKY, Benjamin.Mathematical programming (Print). 2012, Vol 133, Num 1-2, pp 337-363, issn 0025-5610, 27 p.Article

Two-stage quadratic integer programs with stochastic right-hand sidesOZALTIN, Osman Y; PROKOPYEV, Oleg A; SCHAEFER, Andrew J et al.Mathematical programming (Print). 2012, Vol 133, Num 1-2, pp 121-158, issn 0025-5610, 38 p.Article

An augmented Lagrangian approach for sparse principal component analysisZHAOSONG LU; YONG ZHANG.Mathematical programming (Print). 2012, Vol 135, Num 1-2, pp 149-193, issn 0025-5610, 45 p.Article

Integrated market selection and production planning: complexity and solution approachesDEN HEUVEL, Wilco Van; ERHUN KUNDAKCIOGLU, O; GEUNES, Joseph et al.Mathematical programming (Print). 2012, Vol 134, Num 2, pp 395-424, issn 0025-5610, 30 p.Article

Mixing polyhedra with two non divisible coefficientsAGRA, Agostinho; CONSTANTINO, Miguel.Mathematical programming (Print). 2012, Vol 135, Num 1-2, pp 45-87, issn 0025-5610, 43 p.Article

Optimality functions in stochastic programmingROYSET, J. O.Mathematical programming (Print). 2012, Vol 135, Num 1-2, pp 293-321, issn 0025-5610, 29 p.Article

Robust resource allocations in temporal networksWIESEMANN, Wolfram; KUHN, Daniel; RUSTEM, Berç et al.Mathematical programming (Print). 2012, Vol 135, Num 1-2, pp 437-471, issn 0025-5610, 35 p.Article

Bilevel optimization: on the structure of the feasible setJONGEN, H. Th; SHIKHMAN, V.Mathematical programming (Print). 2012, Vol 136, Num 1, pp 65-89, issn 0025-5610, 25 p.Conference Paper

Divide to conquer: decomposition methods for energy optimizationSAGASTIZABAL, C.Mathematical programming (Print). 2012, Vol 134, Num 1, pp 187-222, issn 0025-5610, 36 p.Conference Paper

Minimizing Lipschitz-continuous strongly convex functions over integer points in polytopesBAES, Michel; DEL PIA, Alberto; NESTEROV, Yurii et al.Mathematical programming (Print). 2012, Vol 134, Num 1, pp 305-322, issn 0025-5610, 18 p.Conference Paper

SpeeDP: an algorithm to compute SDP bounds for very large Max-Cut instancesGRIPPO, Luigi; PALAGI, Laura; PIACENTINI, Mauro et al.Mathematical programming (Print). 2012, Vol 136, Num 2, pp 353-373, issn 0025-5610, 21 p.Conference Paper

Stochastic programs without duality gapsPENNANEN, Teemu; PERKKIO, Ari-Pekka.Mathematical programming (Print). 2012, Vol 136, Num 1, pp 91-110, issn 0025-5610, 20 p.Conference Paper

The adaptive convexification algorithm for semi-infinite programming with arbitrary index setsSTEIN, Oliver; STEUERMANN, Paul.Mathematical programming (Print). 2012, Vol 136, Num 1, pp 183-207, issn 0025-5610, 25 p.Conference Paper

A class of nonlinear nonseparable continuous knapsack and multiple-choice knapsack problemsSHARKEY, Thomas C; ROMEIJN, H. Edwin; GEUNES, Joseph et al.Mathematical programming (Print). 2011, Vol 126, Num 1, pp 69-96, issn 0025-5610, 28 p.Article

Fixed point and Bregman iterative methods for matrix rank minimizationSHIQIAN MA; GOLDFARB, Donald; LIFENG CHEN et al.Mathematical programming (Print). 2011, Vol 128, Num 1-2, pp 321-353, issn 0025-5610, 33 p.Article

Implications of the constant rank constraint qualificationSHU LU.Mathematical programming (Print). 2011, Vol 126, Num 2, pp 365-392, issn 0025-5610, 28 p.Article

Modeling disjunctive constraints with a logarithmic number of binary variables and constraintsVIELMA, Juan Pablo; NEMHAUSER, George L.Mathematical programming (Print). 2011, Vol 128, Num 1-2, pp 49-72, issn 0025-5610, 24 p.Article

On the exact separation of mixed integer knapsack cutsFUKASAWA, Ricardo; GOYCOOLEA, Marcos.Mathematical programming (Print). 2011, Vol 128, Num 1-2, pp 19-41, issn 0025-5610, 23 p.Article

Strong KKT conditions and weak sharp solutions in convex-composite optimizationXI YIN ZHENG; KUNG FU NG.Mathematical programming (Print). 2011, Vol 126, Num 2, pp 259-279, issn 0025-5610, 21 p.Article

On verifiable sufficient conditions for sparse signal recovery via ℓ₁ minimizationJUDITSKY, Anatoli; NEMIROVSKI, Arkadi.Mathematical programming (Print). 2011, Vol 127, Num 1, pp 57-88, issn 0025-5610, 32 p.Article

Testing the nullspace property using semidefinite programmingD'ASPREMONT, Alexandre; EL GHAOUI, Laurent.Mathematical programming (Print). 2011, Vol 127, Num 1, pp 123-144, issn 0025-5610, 22 p.Article