Graver basis and proximity techniques for block-structured separable convex integer minimization problems Raymond HemmeckeMatthias KöppeRobert Weismantel Full Length Paper 16 February 2013 Pages: 1 - 18
The triangle closure is a polyhedron Amitabh BasuRobert HildebrandMatthias Köppe Full Length Paper 23 February 2013 Pages: 19 - 58
VI-constrained hemivariational inequalities: distributed algorithms and power control in ad-hoc networks Francisco FacchineiJong-Shi PangLorenzo Lampariello Full Length Paper 15 February 2013 Pages: 59 - 96
Strong Abadie CQ, ACQ, calmness and linear regularity Zhou WeiJen-Chih YaoXi Yin Zheng Full Length Paper 09 June 2013 Pages: 97 - 131
Bundle methods for sum-functions with “easy” components: applications to multicommodity network design Antonio FrangioniEnrico Gorgone Full Length Paper 12 February 2013 Pages: 133 - 161
Dijkstra’s algorithm and L-concave function maximization Kazuo MurotaAkiyoshi Shioura Full Length Paper 05 February 2013 Pages: 163 - 177
Optimality conditions for maximizing a function over a polyhedron William W. HagerJames T. Hungerford Full Length Paper 21 February 2013 Pages: 179 - 198
Design and verify: a new scheme for generating cutting-planes Santanu S. DeySebastian Pokutta Full Length Paper 15 February 2013 Pages: 199 - 222
Efficient formulations for pricing under attraction demand models Philipp W. KellerRetsef LeviGeorgia Perakis Full Length Paper 29 March 2013 Pages: 223 - 261
A geometric characterization of strong duality in nonconvex quadratic programming with linear and nonconvex quadratic constraints Fabián Flores-BazánGabriel Cárcamo Full Length Paper 15 February 2013 Pages: 263 - 290
A new graph parameter related to bounded rank positive semidefinite matrix completions Monique LaurentAntonios Varvitsiotis Full Length Paper 16 February 2013 Pages: 291 - 325
On the Chvátal–Gomory closure of a compact convex set Daniel DadushSantanu S. DeyJuan Pablo Vielma Full Length Paper 26 March 2013 Pages: 327 - 348
Convex hull representation of the deterministic bipartite network interdiction problem Kelly M. SullivanJ. Cole SmithDavid P. Morton Full Length Paper 06 March 2013 Pages: 349 - 376
Preemptive and non-preemptive generalized min sum set cover Sungjin ImMaxim SviridenkoRuben van der Zwaan Full Length Paper 08 March 2013 Pages: 377 - 401
Lifted inequalities for \(0\mathord {-}1\) mixed-integer bilinear covering sets Kwanghun ChungJean-Philippe P. RichardMohit Tawarmalani Full Length Paper 17 April 2013 Pages: 403 - 450
Performance of first-order methods for smooth convex minimization: a novel approach Yoel DroriMarc Teboulle Full Length Paper 23 March 2013 Pages: 451 - 482
Lattice-free sets, multi-branch split disjunctions, and mixed-integer programming Sanjeeb DashNeil B. DobbsGrzegorz M. Świrszcz Full Length Paper 28 March 2013 Pages: 483 - 508
Monotonic stable solutions for minimum coloring games H. HamersS. MiquelH. Norde Full Length Paper 16 March 2013 Pages: 509 - 529
Passivity and complementarity M. K. CamlibelL. IannelliF. Vasca Full Length Paper 16 April 2013 Pages: 531 - 563
Semi-continuous network flow problems Gustavo AnguloShabbir AhmedSantanu S. Dey Full Length Paper 03 April 2013 Pages: 565 - 599
Erratum to: Risk-averse dynamic programming for Markov decision processes Andrzej Ruszczyński Erratum 10 May 2014 Pages: 601 - 604