Branch-and-cut for separable piecewise linear optimization and intersection with semi-continuous constraints I. R. de Farias Jr.E. KozyreffM. Zhao Full Length Paper 08 November 2012 Pages: 75 - 112
Implementation of a unimodularity test Matthias WalterKlaus Truemper Full Length Paper 03 November 2012 Pages: 57 - 73
The time dependent traveling salesman problem: polyhedra and algorithm Hernán AbeledoRicardo FukasawaEduardo Uchoa Full Length Paper 13 September 2012 Pages: 27 - 55
Warmstarting the homogeneous and self-dual interior point method for linear and conic quadratic problems Anders SkajaaErling D. AndersenYinyu Ye Full Length Paper 19 August 2012 Pages: 1 - 25
A comparative study of SQP-type algorithms for nonlinear and nonconvex mixed-integer optimization Oliver ExlerThomas LehmannKlaus Schittkowski Full Length Paper 05 August 2012 Pages: 383 - 412
Solving a low-rank factorization model for matrix completion by a nonlinear successive over-relaxation algorithm Zaiwen WenWotao YinYin Zhang Full Length Paper 13 July 2012 Pages: 333 - 361
Optimal sensitivity based on IPOPT Hans PirnayRodrigo López-NegreteLorenz T. Biegler Full Length Paper 20 June 2012 Pages: 307 - 331
Maximum-weight stable sets and safe lower bounds for graph coloring Stephan HeldWilliam CookEdward C. Sewell Full Length Paper 25 May 2012 Pages: 363 - 381
A computational study of a solver system for processing two-stage stochastic LPs with enhanced Benders decomposition Victor ZverovichCsaba I. FábiánGautam Mitra Full Length Paper 05 May 2012 Pages: 211 - 238
A penalty-interior-point algorithm for nonlinear constrained optimization Frank E. Curtis Full Length Paper 24 April 2012 Pages: 181 - 209
Cutting plane versus compact formulations for uncertain (integer) linear programs Matteo FischettiMichele Monaci Full Length Paper 20 April 2012 Pages: 239 - 273
LP and SDP branch-and-cut algorithms for the minimum graph bisection problem: a computational comparison Michael ArmbrusterMarzena FügenschuhAlexander Martin Full Length Paper 15 April 2012 Pages: 275 - 306
On optimizing over lift-and-project closures Pierre Bonami Full Length Paper 16 March 2012 Pages: 151 - 179
PySP: modeling and solving stochastic programs in Python Jean-Paul WatsonDavid L. WoodruffWilliam E. Hart Full Length Paper 07 March 2012 Pages: 109 - 149
A primal–dual regularized interior-point method for convex quadratic programs M. P. FriedlanderD. Orban Full Length Paper 17 February 2012 Pages: 71 - 107
Globally solving nonconvex quadratic programming problems via completely positive programming Jieqiu ChenSamuel Burer Full Length Paper 16 November 2011 Pages: 33 - 52
Rounding-based heuristics for nonconvex MINLPs Giacomo NanniciniPietro Belotti Full Length Paper 01 September 2011 Pages: 1 - 31
A recipe for finding good solutions to MINLPs Leo LibertiNenad MladenovićGiacomo Nannicini Full Length Paper 26 August 2011 Pages: 349 - 390
A factorization with update procedures for a KKT matrix arising in direct optimal control Christian KirchesHans Georg BockSebastian Sager Full Length Paper 20 August 2011 Pages: 319 - 348
Pyomo: modeling and solving mathematical programs in Python William E. HartJean-Paul WatsonDavid L. Woodruff Full Length Paper 10 August 2011 Pages: 219 - 260
Optimal linear arrangements using betweenness variables Alberto CapraraMarcus OswaldEmiliano Traversi Full Length Paper 02 August 2011 Pages: 261 - 280
Practical strategies for generating rank-1 split cuts in mixed-integer linear programming Gerard CornuéjolsGiacomo Nannicini Full Length Paper 31 July 2011 Pages: 281 - 318
Templates for convex cone problems with applications to sparse signal recovery Stephen R. BeckerEmmanuel J. CandèsMichael C. Grant Full Length Paper 30 July 2011 Pages: 165 - 218
MIPLIB 2010 Thorsten KochTobias AchterbergKati Wolter Full Length Paper 07 June 2011 Pages: 103 - 163
A relax-and-cut framework for Gomory mixed-integer cuts Matteo FischettiDomenico Salvagnin Full Length Paper 09 March 2011 Pages: 79 - 102
Faster min–max resource sharing in theory and practice Dirk MüllerKlaus RadkeJens Vygen Full Length Paper 01 March 2011 Pages: 1 - 35
Quadratic factorization heuristics for copositive programming Immanuel M. BomzeFlorian JarreFranz Rendl Full Length Paper 30 January 2011 Pages: 37 - 57
Computing compatible tours for the symmetric traveling salesman problem Matteo FortiniAdam N. LetchfordKlaus M. Wenger Full Length Paper 29 December 2010 Pages: 59 - 78
An inexact interior point method for L 1-regularized sparse covariance selection Lu LiKim-Chuan Toh Full Length Paper 20 November 2010 Pages: 291 - 315
A heuristic to generate rank-1 GMI cuts Sanjeeb DashMarcos Goycoolea Full Length Paper 16 November 2010 Pages: 231 - 257
Exact algorithm over an arc-time-indexed formulation for parallel machine scheduling problems Artur PessoaEduardo UchoaRosiane Rodrigues Full Length Paper 24 October 2010 Pages: 259 - 290
Alternating direction augmented Lagrangian methods for semidefinite programming Zaiwen WenDonald GoldfarbWotao Yin Full Length Paper 28 September 2010 Pages: 203 - 230
Implementation of nonsymmetric interior-point methods for linear optimization over sparse matrix cones Martin S. AndersenJoachim DahlLieven Vandenberghe Full Length Paper Open access 26 August 2010 Pages: 167 - 201
Efficient high-precision matrix algebra on parallel architectures for nonlinear combinatorial optimization John GunnelsJon LeeSusan Margulies Full Length Paper 19 June 2010 Pages: 103 - 124
The Mcf-separator: detecting and exploiting multi-commodity flow structures in MIPs Tobias AchterbergChristian Raack Full Length Paper 03 July 2010 Pages: 125 - 165
A library of local search heuristics for the vehicle routing problem Chris GroërBruce GoldenEdward Wasil Full Length Paper 08 April 2010 Pages: 79 - 101
A new relaxation framework for quadratic assignment problems based on matrix splitting Jiming PengHans MittelmannXiaoxue Li Full Length Paper 23 February 2010 Pages: 59 - 77
On solving trust-region and other regularised subproblems in optimization Nicholas I. M. GouldDaniel P. RobinsonH. Sue Thorne Full Length Paper 10 February 2010 Pages: 21 - 57
Optimizing a polyhedral-semidefinite relaxation of completely positive programs Samuel Burer Full Length Paper 03 February 2010 Pages: 1 - 19
Information-based branching schemes for binary linear mixed integer problems Fatma Kılınç KarzanGeorge L. NemhauserMartin W. P. Savelsbergh Full Length Paper 13 January 2010 Pages: 249 - 293
A structure-conveying modelling language for mathematical and stochastic programming Marco ColomboAndreas GrotheyJacek Gondzio Full Length Paper 11 November 2009 Pages: 223 - 247
Feasibility pump 2.0 Matteo FischettiDomenico Salvagnin Full Length Paper 17 September 2009 Pages: 201 - 222
Generating lift-and-project cuts from the LP simplex tableau: open source implementation and testing of new variants Egon BalasPierre Bonami Full Length Paper 10 September 2009 Pages: 165 - 199
Support vector machine classification with indefinite kernels Ronny LussAlexandre d’Aspremont Full Length Paper 25 August 2009 Pages: 97 - 118
General k-opt submoves for the Lin–Kernighan TSP heuristic Keld Helsgaun Full Length Paper 01 July 2009 Pages: 119 - 163
Testing cut generators for mixed-integer linear programming François Margot Full Length Paper 29 May 2009 Pages: 69 - 95
Blossom V: a new implementation of a minimum cost perfect matching algorithm Vladimir Kolmogorov Full Length Paper 21 April 2009 Pages: 43 - 67
SCIP: solving constraint integer programs Tobias Achterberg Full length paper 20 January 2009 Pages: 1 - 41
