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