Browse Title Index

Issue Title
Volume 9, Issue 4, December 2017 A branch-and-bound algorithm for instrumental variable quantile regression Abstract   PDF
Guanglin Xu, Samuel Burer
Volume 6, Number 2, June 2014 A branch-and-price algorithm for the multi-depot heterogeneous-fleet pickup and delivery problem with soft time windows Abstract   pdf
Andrea Bettinelli, Alberto Ceselli, Giovanni Righini
Volume 4, Number 4, December 2012 A comparative study of SQP-type algorithms for nonlinear and nonconvex mixed-integer optimization Abstract   PDF
Oliver Exler, Thomas Lehmann, Klaus Schittkowski
Volume 4, Number 3, September 2012 A computational study of a solver system for processing two-stage stochastic LPs with enhanced Benders decomposition Abstract   PDF
Victor Zverovich, Csaba I. Fabian, Eldon F. D. Ellison, Gautam Mitra
Volume 3, Number 4, December 2011 A factorization with update procedures for a KKT matrix arising in direct optimal control Abstract   PDF
Christian Kirches, Hans Georg Bock, Johannes P. Schlöder, Sebastian Sager
Volume 6, Number 2, June 2014 A first-order block-decomposition method for solving two-easy-block structured semidefinite programs Abstract   pdf
Renato D. C. Monteiro, Camilo Ortiz, Benar F. Svaiter
Volume 2, Numbers 3-4, December 2010 A heuristic to generate rank-1 GMI cuts Abstract   PDF
Sanjeeb Dash, Marcos Goycoolea
Volume 5, Number 3, September 2013 A hybrid branch-and-bound approach for exact rational mixed-integer programming Abstract   pdf
William Cook, Thorsten Koch, Daniel E. Steffy, Kati Wolter
Volume 2, Number 2 / June 2010 A library of local search heuristics for the vehicle routing problem Abstract   PDF
Chris Groër, Bruce Golden, Edward Wasil
Volume 8, Issue 1, March 2016 A new novel local search integer-programming-based heuristic for PCB assembly on collect-and-place machines Abstract   pdf
Anupam Seth, Diego Klabjan, Placid M.A new novel local search integer-progr Ferreira
Volume 2, Number 1 / March 2010 A new relaxation framework for quadratic assignment problems based on matrix splitting Abstract   PDF
Jiming Peng, Hans Mittelmann, Xiaoxue Li
Volume 6, Number 2, June 2014 A Newton’s method for the continuous quadratic knapsack problem Abstract   pdf
Roberto Cominetti, Walter F. Mascarenhas, Paulo J. S. Silva
Volume 8, Issue 4, November 2016 A node-based layered graph approach for the Steiner tree problem with revenues, budget and hop-constraints Abstract   pdf
Markus Sinnl, Ivana Ljubic
Volume 8, Issue 3, September 2016 A nonmonotone GRASP Abstract   Untitled
M. De Santis, P. Festa, G. Liuzzi, S. Lucidi, F. Rinaldi
Volume 7, Issue 3, September 2015 A note on “On fast trust region methods for quadratic models with linear constraints”, by Michael J.D. Powell Abstract   PDF
Daniel Bienstock, Philip E. Gill, Nick Gould
Volume 7, Issue 3, September 2015 A parallel quadratic programming method for dynamic optimization problems Abstract   PDF
Janick V. Frasch, Sebastian Sager, Moritz Diehl
Volume 6, Number 3, September 2014 A partial proximal point algorithm for nuclear norm regularized matrix least squares problems Abstract   pdf
Kaifeng Jiang, Defeng Sun, Kim-Chuan Toh
Volume 4, Number 2, June 2012 A penalty-interior-point algorithm for nonlinear constrained optimization Abstract   PDF
Frank E. Curtis
Volume 8, Issue 2, June 2016 A practical volume algorithm Abstract   pdf
Ben Cousins, Santosh Vempala
Volume 4, Number 1, March 2012 A primal–dual regularized interior-point method for convex quadratic programs Abstract   PDF
M. P. Friedlander, D. Orban
Volume 7, Issue 4, December 2015 A quasi-Newton algorithm for nonconvex, nonsmooth optimization with global convergence guarantees Abstract   PDF
Xiaocun Que, Frank E. Curtis
Volume 3, Number 4, December 2011 A recipe for finding good solutions to MINLPs Abstract   PDF
Leo Liberti, Nenad Mladenovic, Giacomo Nannicini
Volume 3, Number 2, June 2011 A relax-and-cut framework for Gomory mixed-integer cuts Abstract   PDF
Matteo Fischetti, Domenico Salvagnin
Volume 10, Issue 1, March 2018 A robust and scalable algorithm for the Steiner problem in graphs Abstract   PDF
Thomas Pajor, Eduardo Uchoa, Renato F. Werneck
Volume 1, Number 4 / December 2009 A structure-conveying modelling language for mathematical and stochastic programming Abstract   PDF
Marco Colombo, Andreas Grothey, Jonathan Hogg, Kristian Woodsend, Jacek Gondzio
Volume 2, Numbers 3-4, December 2010 Alternating direction augmented Lagrangian methods for semidefinite programming Abstract   PDF
Zaiwen Wen, Donald Goldfarb, Wotao Yin
Volume 7, Issue 1, March 2015 Alternating proximal gradient method for sparse nonnegative Tucker decomposition Abstract   PDF
Yangyang Xu
Volume 6, Number 3, September 2014 An exact cooperative method for the uncapacitated facility location problem Abstract   pdf
Marius Posta, Jacques A. Ferland, Philippe Michelon
Volume 2, Numbers 3-4, December 2010 An inexact interior point method for L1-regularized sparse covariance selection Abstract   PDF
Lu Li, Kim-Chuan Toh
Volume 8, Issue 4, November 2016 An SR1/BFGS SQP algorithm for nonconvex nonlinear programs with block-diagonal Hessian matrix Abstract   pdf
Dennis Janka, Christian Kirches, Sebastian Sager, Andreas Wa?chter
Volume 6, Number 1, March 2014 Block splitting for distributed optimization Abstract   pdf
Neal Parikh, Stephen Boyd
Volume 1, Number 1 / July 2009 Blossom V: a new implementation of a minimum cost perfect matching algorithm Abstract   PDF
Vladimir Kolmogorov
Volume 6, Number 3, September 2014 Boosting the feasibility pump Abstract   pdf
Natashia L. Boland, Andrew C. Eberhard, Faramroze G. Engineer, Matteo Fischetti, Martin W. P. Savelsbergh, Angelos Tsoukalas
Volume 5, Number 4, December 2013 Branch-and-cut approaches for chance-constrained formulations of reliable network design problems Abstract   pdf
Yongjia Song, James R. Luedtke
Volume 6, Number 4, December 2014 Branch-and-cut for complementarity-constrained optimization Abstract   pdf
Ismael R. de Farias Jr., Ernee Kozyreff, Ming Zhao
Volume 10, Issue 1, March 2018 Branch-and-cut for linear programs with overlapping SOS1 constraints Abstract   PDF
Tobias Fischer, Marc E. Pfetsch
Volume 5, Number 1, March 2013 Branch-and-cut for separable piecewise linear optimization and intersection with semi-continuous constraints Abstract   pdf
I. R. de Farias Jr, E. Kozyreff, R. Gupta, M. Zhao
Volume 8, Issue 4, November 2016 Capitalizing on live variables: new algorithms for efficient Hessian computation via automatic differentiation Abstract   pdf
Mu Wang, Assefaw Gebremedhin, Alex Pothen
Volume 8, Issue 2, June 2016 CBLIB 2014: a benchmark library for conic mixed-integer and continuous optimization Abstract   pdf
Henrik A. Friberg
Volume 8, Issue 2, June 2016 Communication protocols for options and results in a distributed optimization environment Abstract   pdf
Horand Gassmann, Jun Ma, Kipp Martin
Volume 7, Issue 4, December 2015 Computational study of decomposition algorithms for mean-risk stochastic linear programs Abstract   PDF
Lewis Ntaimo, Tanisha G. Cotton
Volume 3, Number 1, March 2011 Computing compatible tours for the symmetric traveling salesman problem Abstract   PDF
Matteo Fortini, Adam N. Letchford, Andrea Lodi, Klaus M. Wenger
Volume 9, Issue 1, March 2017 Computing convex hulls and counting integer points with polymake Abstract   PDF
Benjamin Assarf, Ewgenij Gawrilow, Katrin Herr, Michael Joswig, Benjamin Lorenz, Andreas Paffenholz, Thomas Rehn
Volume 9, Issue 3, September 2017 Convex quadratic relaxations for mixed-integer nonlinear programs in power systems Abstract   PDF
Hassan Hijazi, Carleton Coffrin, Pascal Van Hentenryck
Volume 8, Issue 4, November 2016 Customizing the solution process of COIN-OR’s linear solvers with Python Abstract   pdf
Mehdi Towhidi, Dominique Orban
Volume 4, Number 3, September 2012 Cutting plane versus compact formulations for uncertain (integer) linear programs Abstract   PDF
Matteo Fischetti, Michele Monaci
Volume 6, Number 1, March 2014 Deterministic “Snakes and Ladders” Heuristic for the Hamiltonian cycle problem Abstract   pdf
Pouya Baniasadi, Vladimir Ejov, Jerzy A. Filar, Michael Haythorpe, Serguei Rossomakhine
Volume 9, Issue 2, June 2017 Dijkstra meets Steiner: a fast exact goal-oriented Steiner tree algorithm Abstract   PDF
Stefan Hougardy, Jannik Silvanus, Jens Vygen
Volume 5, Number 2, June 2013 Efficient block-coordinate descent algorithms for the Group Lasso Abstract   pdf
Zhiwei Qin, Katya Scheinberg, Donald Goldfarb
Volume 2, Number 2 / June 2010 Efficient high-precision matrix algebra on parallel architectures for nonlinear combinatorial optimization Abstract   PDF
John Gunnels, Jon Lee, Susan Margulies
1 - 50 of 124 Items 1 2 3 > >> 

mpc footer
© MPS 2008-2018