default search action
Mathematical Programming Computation, Volume 3
Volume 3, Number 1, March 2011
- Dirk Müller, Klaus Radke, Jens Vygen:
Faster min-max resource sharing in theory and practice. 1-35 - Immanuel M. Bomze, Florian Jarre, Franz Rendl:
Quadratic factorization heuristics for copositive programming. 37-57 - Matteo Fortini, Adam N. Letchford, Andrea Lodi, Klaus Michael Wenger:
Computing compatible tours for the symmetric traveling salesman problem. 59-78
Volume 3, Number 2, June 2011
- Matteo Fischetti, Domenico Salvagnin:
A relax-and-cut framework for Gomory mixed-integer cuts. 79-102 - Thorsten 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. 103-163
Volume 3, Number 3, September 2011
- Stephen Becker, Emmanuel J. Candès, Michael C. Grant:
Templates for convex cone problems with applications to sparse signal recovery. 165-218 - William E. Hart, Jean-Paul Watson, David L. Woodruff:
Pyomo: modeling and solving mathematical programs in Python. 219-260 - Alberto Caprara, Marcus Oswald, Gerhard Reinelt, Robert Schwarz, Emiliano Traversi:
Optimal linear arrangements using betweenness variables. 261-280
Volume 3, Number 4, December 2011
- Gérard Cornuéjols, Giacomo Nannicini:
Practical strategies for generating rank-1 split cuts in mixed-integer linear programming. 281-318 - Christian Kirches, Hans Georg Bock, Johannes P. Schlöder, Sebastian Sager:
A factorization with update procedures for a KKT matrix arising in direct optimal control. 319-348 - Leo Liberti, Nenad Mladenovic, Giacomo Nannicini:
A recipe for finding good solutions to MINLPs. 349-390
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.