External Links

    Journal: Math. Program. Comput.

    Volume 3, Issue 4

    281 -- 318Gérard Cornuéjols, Giacomo Nannicini. Practical strategies for generating rank-1 split cuts in mixed-integer linear programming
    319 -- 348Christian Kirches, Hans Georg Bock, Johannes P. Schlöder, Sebastian Sager. A factorization with update procedures for a KKT matrix arising in direct optimal control
    349 -- 390Leo Liberti, Nenad Mladenovic, Giacomo Nannicini. A recipe for finding good solutions to MINLPs

    Volume 3, Issue 3

    165 -- 218Stephen Becker, Emmanuel J. Candès, Michael C. Grant. Templates for convex cone problems with applications to sparse signal recovery
    219 -- 260William E. Hart, Jean-Paul Watson, David L. Woodruff. Pyomo: modeling and solving mathematical programs in Python
    261 -- 280Alberto Caprara, Marcus Oswald, Gerhard Reinelt, Robert Schwarz, Emiliano Traversi. Optimal linear arrangements using betweenness variables

    Volume 3, Issue 2

    79 -- 102Matteo Fischetti, Domenico Salvagnin. A relax-and-cut framework for Gomory mixed-integer cuts
    103 -- 163Thorsten Koch, Tobias Achterberg, Erling Andersen, Oliver Bastert, Timo Berthold, Robert E. Bixby, Emilie Danna, Gerald Gamrath, Ambros M. Gleixner, Stefan Heinz, Andrea Lodi, Hans D. Mittelmann, Ted K. Ralphs, Domenico Salvagnin, Daniel E. Steffy, Kati Wolter. MIPLIB 2010

    Volume 3, Issue 1

    1 -- 35Dirk Müller 0003, Klaus Radke, Jens Vygen. Faster min-max resource sharing in theory and practice
    37 -- 57Immanuel M. Bomze, Florian Jarre, Franz Rendl. Quadratic factorization heuristics for copositive programming
    59 -- 78Matteo Fortini, Adam N. Letchford, Andrea Lodi, Klaus Michael Wenger. Computing compatible tours for the symmetric traveling salesman problem
    runs on