Browse Title Index


 
Issue Title
 
Volume 9, Issue 4, December 2017 On the computational efficiency of subgradient methods: a case study with Lagrangian bounds Abstract   PDF
Antonio Frangioni, Bernard Gendron, Enrico Gorgone
 
Volume 5, Number 4, December 2013 On the safety of Gomory cut generators Abstract   pdf
Gérard Cornuéjols, François Margot, Giacomo Nannicini
 
Volume 3, Number 3, August 2011 Optimal linear arrangements using betweenness variables Abstract   PDF
Alberto Caprara, Marcus Oswald, Gerhard Reinelt, Robert Schwarz, Emiliano Traversi
 
Volume 4, Number 4, December 2012 Optimal sensitivity based on IPOPT Abstract   PDF
Hans Pirnay, Rodrigo López-Negrete, L. T. Biegler
 
Volume 6, Number 3, September 2014 Optimization of algorithms with OPAL Abstract   pdf
Charles Audet, Kien-Cong Dang, Dominique Orban
 
Volume 2, Number 1 / March 2010 Optimizing a polyhedral-semidefinite relaxation of completely positive programs Abstract   PDF
Samuel Burer
 
Volume 11, Issue 2, June 2019 Optimizing over pure stationary equilibria in consensus stopping games Abstract   PDF
Amin Dehghanian, Murat Kurt, Andrew J. Schaefer
 
Volume 5, Number 2, June 2013 Parallel stochastic gradient algorithms for large-scale matrix completion Abstract   pdf
Benjamin Recht, Christopher Ré
 
Volume 10, Issue 1, March 2018 Parallelizing the dual revised simplex method Abstract   PDF
Q. Huangfu, J. A. J. Hall
 
Volume 7, Issue 4, December 2015 PEBBL: an object-oriented framework for scalable parallel branch and bound Abstract   PDF
Jonathan Eckstein, William E. Hart, Cynthia A. Phillips
 
Volume 8, Issue 3, September 2016 Phase retrieval for imaging problems Abstract   pdf
Fajwel Fogel, Irène Waldspurger, Alexandre d’Aspremont
 
Volume 3, Number 4, December 2011 Practical strategies for generating rank-1 split cuts in mixed-integer linear programming Abstract   PDF
Gerard Cornuéjols, Giacomo Nannicini
 
Volume 7, Issue 4, December 2015 Progress in presolving for mixed integer programming Abstract   PDF
Gerald Gamrath, Thorsten Koch, Alexander Martin, Matthias Miltenberger, Dieter Weninger
 
Volume 10, Issue 2, June 2018 pyomo.dae: a modeling and automatic discretization framework for optimization with differential and algebraic equations Abstract   PDF
Bethany Nicholson, John D. Siirola, Jean-Paul Watson, Victor M. Zavala, Lorenz T. Biegler
 
Volume 3, Number 3, August 2011 Pyomo: modeling and solving mathematical programs in Python Abstract   PDF
Hart E. Hart, Jean-Paul Watson, David L. Woodruff
 
Volume 4, Number 2, June 2012 PySP: modeling and solving stochastic programs in Python Abstract   PDF
Jean-Paul Watson, David L. Woodruff, William E. Hart
 
Volume 11, Issue 2, June 2019 QPLIB: a library of quadratic programming instances Abstract   PDF
Fabio Furini, Emiliano Traversi, Pietro Belotti, Antonio Frangioni, Ambros Gleixner, Nick Gould, Leo Liberti, Andrea Lodi, Ruth Misener, Hans Mittelmann, Nikolaos V. Sahinidis, Stefan Vigerske, Angelika Wiegele
 
Volume 6, Number 4, December 2014 qpOASES: a parametric active-set algorithm for quadratic programming Abstract   pdf
Hans Joachim Ferreau, Christian Kirches, Andreas Potschka, Hans Georg Bock, Moritz Diehl
 
Volume 10, Issue 4, December 2018 QSDPNAL: a two-phase augmented Lagrangian method for convex quadratic semidefinite programming Abstract   PDF
Xudong Li, Defeng Sun, Kim-Chuan Toh
 
Volume 3, Number 1, March 2011 Quadratic factorization heuristics for copositive programming Abstract   PDF
Immanuel M. Bomze, Florian Jarre, Franz Rendl
 
Volume 10, Issue 4, December 2018 RBFOpt: an open-source library for black-box optimization with costly function evaluations Abstract   PDF
Alberto Costa, Giacomo Nannicini
 
Volume 6, Number 1, March 2014 RENS Abstract   pdf
Timo Berthold
 
Volume 8, Issue 3, September 2016 Revisiting compressed sensing: exploiting the efficiency of simplex and sparsification methods Abstract   pdf
Robert Vanderbei, Kevin Lin, Han Liu, Lie Wang
 
Volume 8, Issue 3, September 2016 RLT-POS: Reformulation-Linearization Technique-based optimization software for solving polynomial programming problems Abstract   pdf
Evrim Dalkiran, Hanif D. Sherali
 
Volume 4, Number 1, March 2012 Rounding-based heuristics for nonconvex MINLPs Abstract   PDF
Giacomo Nannicini, Pietro Belotti
 
Volume 9, Issue 2, June 2017 SCIP-Jack—a solver for STP and variants with parallelization extensions Abstract   PDF
Gerald Gamrath, Thorsten Koch, Stephen J. Maher, Daniel Rehfeldt, Yuji Shinano
 
Volume 1, Number 1 / July 2009 SCIP: Solving constraint integer programs Abstract   PDF
Tobias Achterberg
 
Volume 7, Issue 3, September 2015 SDPNAL+: a majorized semismooth Newton-CG augmented Lagrangian method for semidefinite programming with nonnegative constraints Abstract   PDF
Kim-Chuan Toh, Liuqin Yang, Defeng Sun
 
Volume 11, Issue 3, September 2019 Sieve-SDP: a simple facial reduction algorithm to preprocess semidefinite programs Abstract   PDF
Yuzixuan Zhu, Gábor Pataki, Quoc Tran-Dinh
 
Volume 11, Issue 2, June 2019 Simplex QP-based methods for minimizing a conic quadratic objective over polyhedra Abstract   PDF
Alper Atamtürk, Andres Gomez
 
Volume 4, Number 4, December 2012 Solving a low-rank factorization model for matrix completion by a nonlinear successive over-relaxation algorithm Abstract   PDF
Zaiwen Wen, W. Yin, Y. Zhang
 
Volume 11, Issue 1, March 2019 Solving equilibrium problems using extended mathematical programming Abstract   PDF
Youngdae Kim, Michael C. Ferris
 
Volume 11, Issue 3, September 2019 Solving equilibrium problems using extended mathematical programming Abstract   PDF
Youngdae Kim, Michael C. Ferris
 
Volume 11, Issue 2, June 2019 Solving linear programs with complementarity constraints using branch-and-cut Abstract   PDF
Bin Yu, John E. Mitchel, Jong-Shi Pang
 
Volume 7, Issue 2, June 2015 Solving network design problems via iterative aggregation Abstract   pdf
Andreas Bärmann, Frauke Liers, Alexander Martin, Maximilian Merkert, Christoph Thurner, Dieter Weninger
 
Volume 11, Issue 3, September 2019 Solving quadratic programs to high precision using scaled iterative refinement Abstract   PDF
Tobias Weber, Ambros Gleixner, Sebastian Sager
 
Volume 7, Issue 3, September 2015 Solving the equality generalized traveling salesman problem using the Lin–Kernighan–Helsgaun Algorithm Abstract   PDF
Keld Helsgaun
 
Volume 10, Issue 1, March 2018 Sparse-BSOS: a bounded degree SOS hierarchy for large scale polynomial optimization with sparsity Abstract   PDF
Tillmann Weisser, Jean B. Lasserre, Kim-Chuan Toh
 
Volume 1, Numbers 2-3 / October 2009 Support vector machine classification with indefinite kernels Abstract   PDF
Ronny Luss, Alexandre d’Aspremont
 
Volume 9, Issue 2, June 2017 Swap-vertex based neighborhood for Steiner tree problems Abstract   PDF
Zhang-Hua Fu, Jin-Kao Hao
 
Volume 5, Number 3, September 2013 TACO: a toolkit for AMPL control optimization Abstract   pdf
Christian Kirches, Sven Leyffer
 
Volume 3, Number 3, August 2011 Templates for convex cone problems with applications to sparse signal recovery Abstract   PDF
Stephen R. Becker, Emmanuel J. Candès, Michael C. Grant
 
Volume 1, Number 1 / July 2009 Testing cut generators for mixed-integer linear programming Abstract   PDF
François Margot
 
Volume 11, Issue 2, June 2019 The (not so) trivial lifting in two dimensions Abstract   PDF
Ricardo Fukasawa, Laurent Poirrier, Alinson S. Xavier
 
Volume 10, Issue 4, December 2018 The GeoSteiner software package for computing Steiner trees in the plane: an updated computational study Abstract   PDF
Daniel Juhl, David M. Warme, Pawel Winter, Martin Zachariasen
 
Volume 8, Issue 2, June 2016 The L-shape search method for triobjective integer programming Abstract   pdf
Natashia Boland, Hadi Charkhgard, Martin Savelsbergh
 
Volume 2, Number 2 / June 2010 The MCF-separator: detecting and exploiting multi-commodity flow structures in MIPs Abstract   PDF
Tobias Achterberg, Christian Raack
 
Volume 7, Issue 2, June 2015 The strength of multi-row models Abstract   pdf
Quentin Louveaux, Laurent Poirrier, Domenico Salvagnin
 
Volume 5, Number 1, March 2013 The time dependent traveling salesman problem: polyhedra and algorithm Abstract   pdf
Hernán Abeledo, Ricardo Fukasawa, Artur Pessoa, Eduardo Uchoa
 
Volume 9, Issue 2, June 2017 Thinning out Steiner trees: a node-based model for uniform edge costs Abstract   PDF
Matteo Fischetti, Markus Leitner, Ivana Ljubic, Martin Luipersbeck, Michele Monaci, Max Resch, Domenico Salvagnin, Markus Sinnl
 
101 - 150 of 153 Items << < 1 2 3 4 > >> 


mpc footer
© MPS 2008-2019