Publisher
Springer International Publishing
Reference69 articles.
1. K. Aardal, C.P.M. Van Hoesel, Polyhedral techniques in combinatorial optimization I: theory. Stat. Neerlandica 50, 3–26 (1996)
2. K. Aardal, C.P.M. Van Hoesel, Polyhedral techniques in combinatorial optimization II: applications and computations. Stat. Neerlandica 53, 131–177 (1999)
3. K. Aardal, R. Weismantel, Polyhedral combinatorics, in Annotated Bibliographies in Combinatorial Optimization, ed. by M. Dell’Amico, F. Maffioli, S. Martello (Wiley, New York, 1997), pp. 31–44
4. D. Avis, On the complexity of testing hypermetric, negative type, k-gonal and gap inequalities, in Discrete and Computational Geometry, ed. by J. Akiyama, M. Kanö (Springer, Berlin, 2003), pp. 51–59
5. D. Avis, J. Umemoto, Stronger linear programming relaxations of max-cut. Math. Program. 97, 451–469 (2003)