dblp: Mathematical Programming, Volume 132

Hiroshi Yamashita, Hiroshi Yabe: Local and superlinear convergence of a primal-dual interior point method for nonlinear semidefinite programming. 1-30

Simge Küçükyavuz: On mixing sets arising in chance-constrained programming. 31-56

Edwin O'Shea, András Sebö: Alternatives for testing total dual integrality. 57-78

Alper Atamtürk, Kiavash Kianfar: n-step mingling inequalities: new facets for the mixed-integer knapsack set. 79-98

Anna von Heusinger, Christian Kanzow, Masao Fukushima: Newton's method for computing a normalized equilibrium in the generalized Nash game through fixed point formulation. 99-123

Sanjeeb Dash, Ricardo Fukasawa, Oktay Günlük: The master equality polyhedron with multiple rows. 125-151

Frank Plastria, Emilio Carrizosa: Minmax-distance approximation and separation problems: geometrical properties. 153-177

Konstantin Avrachenkov, Regina Sandra Burachik, Jerzy A. Filar, Vladimir Gaitsgory: Constraint augmentation in pseudo-singularly perturbed linear programs. 179-208

Dimitris Magos, Ioannis Mourtos, Gautam Appa: A polyhedral approach to the alldifferent system. 209-260

Kenjiro Takazawa: A weighted independent even factor algorithm. 261-276

Alessandro Agnetis, Enrico Grande, Andrea Pacifici: Demand allocation with latency cost functions. 277-294

Hubertus Th. Jongen, Vladimir Shikhman, Sonja Steffensen: Characterization of strong stability for C-stationary points in MPCC. 295-308

Angel Corberán, Marcus Oswald, Isaac Plana, Gerhard Reinelt, José M. Sanchis: New results on the Windy Postman Problem. 309-332

Hélène Frankowska, Marc Quincampoix: Hölder metric regularity of set-valued maps. 333-354

Leah Epstein, Asaf Levin: Bin packing with general cost structures. 355-391

Ulrich Faigle, Walter Kern, Britta Peis: A ranking model for the greedy algorithm and discrete convexity. 393-407

Mathematical Programming, Volume 132

Volume 132, Numbers 1-2, April 2012