| 1 | -- | 29 | Guanghui Lan, Zhaosong Lu, Renato D. C. Monteiro. Primal-dual first-order methods with ::::O::::(1/e) iteration-complexity for cone programming |
| 31 | -- | 67 | Khalid Addi, Bernard Brogliato, Daniel Goeleven. A qualitative mathematical analysis of a class of linear variational inequalities via semi-complementarity problems: applications in electronics |
| 69 | -- | 96 | Thomas C. Sharkey, H. Edwin Romeijn, Joseph Geunes. A class of nonlinear nonseparable continuous knapsack and multiple-choice knapsack problems |
| 97 | -- | 117 | Raymond Hemmecke, Shmuel Onn, Robert Weismantel. A polynomial oracle-time algorithm for convex integer minimization |
| 119 | -- | 146 | Luigi Grippo, Laura Palagi, Veronica Piccialli. An unconstrained minimization method for solving low-rank SDP relaxations of the maxcut problem |
| 147 | -- | 178 | James Ostrowski, Jeff Linderoth, Fabrizio Rossi, Stefano Smriglio. Orbital branching |
| 179 | -- | 190 | Ralf Gollmer, Uwe Gotzes, Rüdiger Schultz. A note on second-order stochastic dominance constraints induced by mixed-integer linear recourse |
| 191 | -- | 0 | Daya Ram Gaur, Ramesh Krishnamurti, Rajeev Kohli. Erratum to: The capacitated max ::::k::::-cut problem |
| 193 | -- | 201 | Zhaosong Lu. A computational study on robust portfolio selection based on a joint ellipsoidal uncertainty set |