Journal: Math. Program.

Volume 132, Issue 1-2

1 -- 30Hiroshi Yamashita, Hiroshi Yabe. Local and superlinear convergence of a primal-dual interior point method for nonlinear semidefinite programming
31 -- 56Simge Küçükyavuz. On mixing sets arising in chance-constrained programming
57 -- 78Edwin O'Shea, András Sebö. Alternatives for testing total dual integrality
79 -- 98Alper Atamtürk, Kiavash Kianfar. n-step mingling inequalities: new facets for the mixed-integer knapsack set
99 -- 123Anna von Heusinger, Christian Kanzow, Masao Fukushima. Newton's method for computing a normalized equilibrium in the generalized Nash game through fixed point formulation
125 -- 151Sanjeeb Dash, Ricardo Fukasawa, Oktay Günlük. The master equality polyhedron with multiple rows
153 -- 177Frank Plastria, Emilio Carrizosa. Minmax-distance approximation and separation problems: geometrical properties
179 -- 208Konstantin Avrachenkov, Regina Sandra Burachik, Jerzy A. Filar, Vladimir Gaitsgory. Constraint augmentation in pseudo-singularly perturbed linear programs
209 -- 260Dimitris Magos, Ioannis Mourtos, Gautam Appa. A polyhedral approach to the alldifferent system
261 -- 276Kenjiro Takazawa. A weighted independent even factor algorithm
277 -- 294Alessandro Agnetis, Enrico Grande, Andrea Pacifici. Demand allocation with latency cost functions
295 -- 308Hubertus Th. Jongen, Vladimir Shikhman, Sonja Steffensen. Characterization of strong stability for C-stationary points in MPCC
309 -- 332Angel Corberán, Marcus Oswald, Isaac Plana, Gerhard Reinelt, José M. Sanchis. New results on the Windy Postman Problem
333 -- 354Hélène Frankowska, Marc Quincampoix. Hölder metric regularity of set-valued maps
355 -- 391Leah Epstein, Asaf Levin. Bin packing with general cost structures
393 -- 407Ulrich Faigle, Walter Kern, Britta Peis. A ranking model for the greedy algorithm and discrete convexity