On the complexity of cutting-plane proofs
Under an Elsevier user license
open archive
Cited by (0)
- ∗
Supported by a grant from the Alexander von Humbolt Stiftung and by the Institut für Ökonometrie und Operations Research of the University of Bonn, W. Germany.
- ∗∗
Supported by the joint research project “Algorithmic Aspects of Combinatorial Optimization” of the Hungarian Academy of Sciences (Magyar Tudományos Akadémia) and the German Research Association (Deutsche Forschungsgemeinschaft) and SFB 303 (DFG).
Copyright © 1987 Published by Elsevier B.V.