General Mixed Integer Programming: Computational Issues for Branch-and-Cut Algorithms

Alexander Martin. General Mixed Integer Programming: Computational Issues for Branch-and-Cut Algorithms. In Michael Jünger, Denis Naddef, editors, Computational Combinatorial Optimization, Optimal or Provably Near-Optimal Solutions [based on a Spring School, Schloß Dagstuhl, Germany, 15-19 May 2000]. Volume 2241 of Lecture Notes in Computer Science, pages 1-25, Springer, 2001. [doi]

Abstract

Abstract is missing.