Logo - springer
Slogan - springer

Mathematics | Mathematical Programming Computation - incl. option to publish open access (Editorial Board)

Mathematical Programming Computation

Mathematical Programming Computation

A Publication of the Mathematical Optimization Society

Editor-in-Chief: Daniel Bienstock

ISSN: 1867-2949 (print version)
ISSN: 1867-2957 (electronic version)

Journal no. 12532


Daniel Bienstock
Department of Industrial Engineering and Operations Research
Columbia University
500 West 120th St.
New York, NY 10027, USA
e-mail: dano@columbia.edu

General Editor: Thorsten Koch, Konrad-Zuse-Zentrum Berlin, Germany

Production Editor: Wolfgang Dalitz, Konrad-Zuse-Zentrum Berlin, Germany

Area Editors

Alper Atamturk, University of California-Berkeley (Area: Linear and Integer Programming)
Robert Fourer, Northwestern University (Area: Modeling Languages and Systems)
Andrew Goldberg, Microsoft Research (Area: Graph Algorithms and Data Structures)
Nicolas I.M. Gould, Rutherford Appleton Laboratory, Oxfordshire, UK (Area: Nonlinear Optimization)
Jeffrey T. Linderoth, University of Wisconsin-Madison (Area: Stochastic Optimization, Robust Optimization, and Global Optimization)
F. Bruce Shepherd, McGill University, Montreal (Area: Combinatorial Optimization)
Kim-Chuan Toh, National University of Singapore (Area: Convex Optimization)

Associate Editors

Shabbir Ahmed, Georgia Institute of Technology, Atlanta, GA, USA
Sanjeeb Dash, IBM TJ Watson Research Center, Yorktown Heights, NY, USA
Camil Demetrescu, University of Rome, Italy
Matteo Fischetti, University of Padova, Italy
Emmanuel Fragniere, Haute Ecole de Gestion, Geneva, Switzerland
Michael P. Friedlander, University of British Columbia, Vancouver, BC, Canada
Jacek Gondzio, University of Edinburgh, Scotland
Philip E. Gill, University of California San Diego, La Jolla, CA, USA
Oktay Günlük, IBM TJ Watson Reserch Center, Yorktown Heights, NY, USA
Michal Kocvara, University of Birmingham, UK
Andrea Lodi, University of Bologna, Italy
François Margot, Carnegie Mellon University, Pittsburg, PA, USA
Rafael Marti, University of Valencia, Spain
Alexander Martin, Universität Erlangen-Nürnberg, Germany
Laurent Michel, University of Connecticut, Storrs, CT, USA
Petra Mutzel, Technische Universitaet Dortmund, Germany
David Pisinger, University of Copenhagen, Denmark
Hou-Duo Qi, University of Southampton, UK
Nikolaos V. Sahinidis, Carnegie Mellon University, Pittsburg, PA, USA
Peter Sanders, University of Karlsruhe, Germany
Melvyn Sim, National University of Singapore
Huseyin Topaloglu, Cornell University, Ithaca, NY, USA
Michael Ulbrich, Technische Universitaet Muenchen, Germany
Andreas Waechter, Northwestern University, Evanston, IL, USA
Renato Werneck, Microsoft Research, Mountain View, CA, USA
Yin Zhang, Rice University, Houston, TX, USA

Technical Editors

Tobias Achterberg, Gurobi Optimization
David Applegate, AT&T Research, Florham Park, NJ, USA
Pietro Belotti, FICO
Hande Y. Benson, Drexel University, Philadelphia, PA, USA
Timo Berthold, FICO 
Andreas Bley, University of Kassel, Germany
Brian Borchers, New Mexico Tech, Soccoro, NM, USA
Jordi Castro, Universitat Politècnica de Catalunya, Barcelona, Spain
Emilie Danna, Google
Jon Eckstein, Rutgers University, USA
Daniel Espinoza, Universidade de Chile, Santiago, Chile
Armin Fügenschuh, Universität der Bundeswehr, Hamburg, Germany
Andreas Grothey, University of Edinburgh, Scotland
Zonghao Gu, Gurobi Optimization
William Hart, Sandia National Laboratories, Albuquerque, NM, USA
Keld Helsgaun, Roskilde University, Denmark
Benjamin Hiller, Konrad-Zuse-Zentrum Berlin, Germany
Ekaterina A. Kostina, University of Marburg, Germany
Laszlo Ladanyi, IBM
Leonardo B. Lopes, University of Arizona, Tucson, AZ, USA
Todd S. Munson, Argonne National Laboratory, Argonne, IL, USA
Giacomo Nannicini, Singapore University of Technology and Design
Dominique Orban, Ecole Polytechnique de Montréal, Québec, Canada
Michael Perregaard, FICO
Marc Pfetsch, Technische Universität Darmstadt, Germany
Ted Ralphs, Lehigh University, Bethlehem, PA, USA
Domenico Salvagnin, University of Padova, Italy
Lars Schewe, Friedrich-Alexander Universität Erlangen-Nürnberg, Germany
Martin Schmidt, Friedrich-Alexander Universität Erlangen-Nürnberg, Germany
Jonas Schweiger, Konrad-Zuse-Zentrum Berlin, Germany
Mohit Tawarmalani, Purdue University, West Lafayette, IN, USA
Stefan Vigerske, GAMS, Berlin, Germany
Richard A. Waltz, University of Southern California, Los Angeles, CA, USA
Stefan Wild, Argonne National Laboratory, USA

Advisory Board

Robert E. Bixby, Rice University, Houston, TX, USA
Donald Goldfarb, Columbia University, NY, USA
Nick Gould, Rutherford Appleton Laboratory, Oxfordshire, UK
Martin Grötschel, Konrad-Zuse-Zentrum Berlin, Germany
David S. Johnson, Columbia University, New York, NY, USA 
Kurt Mehlhorn, Max-Planck-Institut für Informatik, Saarbrücken, Germany
Hans D. Mittelmann, Arizona State University, Tempe, AZ, USA
Arkadi Nemirovski, Georgia Tech, Atlanta, GA, USA
Jorge Nocedal, Northwestern University, Evanstone, IL, USA
Michael Trick, Carnegie Mellon University, Pittsburgh, PA, USA
Robert Vanderbei, Princeton University, NJ, USA
David P. Williamson, Cornell University, Ithaca, NY, USA



For authors and editors

  • Aims and Scope

    Aims and Scope


    Mathematical Programming Computation (MPC) publishes original research articles covering computational issues in mathematical programming. Articles report on innovative software, comparative tests, modeling environments, libraries of data, and/or applications. A main feature of the journal is the inclusion of accompanying software and data with submitted manuscripts. The journal's review process includes the evaluation and testing of the accompanying software. Where possible, the review will aim for verification of reported computational results. Topics covered in MPC include linear programming, convex optimization, nonlinear optimization, stochastic optimization, robust optimization, integer programming, combinatorial optimization, global optimization, network algorithms, and modeling languages.

  • Submit Online
  • Open Choice - Your Way to Open Access
  • Instructions for Authors

    Instructions for Authors


  • Author Academy: Training for Authors
  • Copyright information

    Copyright information


    Copyright Information

    For Authors

    Submission of a manuscript implies: that the work described has not been published before (except in form of an abstract or as part of a published lecture, review or thesis); that it is not under consideration for publication elsewhere; that its publication has been approved by all co-authors, if any, as well as – tacitly or explicitly – by the responsible authorities at the institution where the work was carried out.

    Author warrants (i) that he/she is the sole owner or has been authorized by any additional copyright owner to assign the right, (ii) that the article does not infringe any third party rights and no license from or payments to a third party is required to publish the article and (iii) that the article has not been previously published or licensed. The author signs for and accepts responsibility for releasing this material on behalf of any and all co-authors. Transfer of copyright to Springer (respective to owner if other than Springer) becomes effective if and when a Copyright Transfer Statement is signed or transferred electronically by the corresponding author. After submission of the Copyright Transfer Statement signed by the corresponding author, changes of authorship or in the order of the authors listed will not be accepted by Springer.

    The copyright to this article, including any graphic elements therein (e.g. illustrations, charts, moving images), is assigned for good and valuable consideration to Springer effective if and when the article is accepted for publication and to the extent assignable if assignability is restricted for by applicable law or regulations (e.g. for U.S. government or crown employees).

    The copyright assignment includes without limitation the exclusive, assignable and sublicensable right, unlimited in time and territory, to reproduce, publish, distribute, transmit, make available and store the article, including abstracts thereof, in all forms of media of expression now known or developed in the future, including pre- and reprints, translations, photographic reproductions and microform. Springer may use the article in whole or in part in electronic form, such as use in databases or data networks for display, print or download to stationary or portable devices. This includes interactive and multimedia use and the right to alter the article to the extent necessary for such use.

    Authors may self-archive the Author's accepted manuscript of their articles on their own websites. Authors may also deposit this version of the article in any repository, provided it is only made publicly available 12 months after official publication or later. He/she may not use the publisher's version (the final article), which is posted on SpringerLink and other Springer websites, for the purpose of self-archiving or deposit. Furthermore, the Author may only post his/her version provided acknowledgement is given to the original source of publication and a link is inserted to the published article on Springer's website. The link must be accompanied by the following text: "The final publication is available at link.springer.com".

    Prior versions of the article published on non-commercial pre-print servers like arXiv.org can remain on these servers and/or can be updated with Author's accepted version. The final published version (in pdf or html/xml format) cannot be used for this purpose. Acknowledgement needs to be given to the final publication and a link must be inserted to the published article on Springer's website, accompanied by the text "The final publication is available at link.springer.com". Author retains the right to use his/her article for his/her further scientific career by including the final published journal article in other publications such as dissertations and postdoctoral qualifications provided acknowledgement is given to the original source of publication.

    Author is requested to use the appropriate DOI for the article. Articles disseminated via link.springer.com are indexed, abstracted and referenced by many abstracting and information services, bibliographic networks, subscription agencies, library networks, and consortia.

    For Readers

    While the advice and information in this journal is believed to be true and accurate at the date of its publication, neither the authors, the editors, nor the publisher can accept any legal responsibility for any errors or omissions that may have been made. The publisher makes no warranty, express or implied, with respect to the material contained herein.

    All articles published in this journal are protected by copyright, which covers the exclusive rights to reproduce and distribute the article (e.g., as offprints), as well as all translation rights. No material published in this journal may be reproduced photographically or stored on microfilm, in electronic data bases, video disks, etc., without first obtaining written permission from the publisher (respective the copyright owner if other than Springer). The use of general descriptive names, trade names, trademarks, etc., in this publication, even if not specifically identified, does not imply that these names are not protected by the relevant laws and regulations.

    Springer has partnered with Copyright Clearance Center's RightsLink service to offer a variety of options for reusing Springer content. For permission to reuse our content please locate the material that you wish to use on link.springer.com or on springerimages.com and click on the permissions link or go to copyright.com, then enter the title of the publication that you wish to use. For assistance in placing a permission request, Copyright Clearance Center can be connected directly via phone: +1-855-239-3415, fax: +1-978-646-8600, or e-mail: info@copyright.com.

    © Springer-Verlag Berlin Heidelberg and Mathematical Optimization Society

Alerts for this journal


Get the table of contents of every new issue published in Mathematical Programming Computation.