- James B. Orlin:
A Faster Strongly Polynomial Time Algorithm for Submodular Function Minimization. IPCO 2007: 240-251 - James Ostrowski, Jeff T. Linderoth, Fabrizio Rossi, Stefano Smriglio:
Orbital Branching. IPCO 2007: 104-118 - Franz Rendl, Giovanni Rinaldi, Angelika Wiegele:
A Branch and Bound Algorithm for Max-Cut Based on Combining Semidefinite and Polyhedral Relaxations. IPCO 2007: 295-309 - Tim Roughgarden, Mukund Sundararajan:
Optimal Efficiency Guarantees for Network Design Mechanisms. IPCO 2007: 469-483 - David B. Shmoys, Mauro Sozio:
Approximation Algorithms for 2-Stage Stochastic Scheduling Problems. IPCO 2007: 145-157 - Bo Zeng, Jean-Philippe P. Richard:
A Framework to Derive Multidimensional Superadditive Lifting Functions and Its Applications. IPCO 2007: 210-224 - Matteo Fischetti, David P. Williamson:
Integer Programming and Combinatorial Optimization, 12th International IPCO Conference, Ithaca, NY, USA, June 25-27, 2007, Proceedings. Lecture Notes in Computer Science 4513, Springer 2007, ISBN 978-3-540-72791-0 [contents]