A Primal Approach to the Stable Set Problem
暂无分享,去创建一个
Claudio Gentile | Giovanni Rinaldi | Matthias Köppe | Robert Weismantel | Utz-Uwe Haus | C. Gentile | G. Rinaldi | R. Weismantel | M. Köppe | U. Haus
[1] Matthias Köppe,et al. The integral basis method for integer programming , 2001, Math. Methods Oper. Res..
[2] G. Cornuéjols,et al. Combinatorial optimization : packing and covering , 2001 .
[3] Manfred W. Padberg,et al. On the symmetric travelling salesman problem: A computational study , 1980 .
[4] Egon Balas,et al. Polyhedral methods for the maximum clique problem , 1994, Cliques, Coloring, and Satisfiability.
[5] G. Nemhauser,et al. A Strong Cutting Plane/Branch-and-Bound Algorithm for Node Packing , 1992 .
[6] László Lovász,et al. Normal hypergraphs and the perfect graph conjecture , 1972, Discret. Math..
[7] L. Lovász. Normal Hypergraphs and the Weak Perfect Graph Conjecture , 1984 .
[8] Egon Balas,et al. On the Set-Covering Problem: II. An Algorithm for Set Partitioning , 1972, Oper. Res..
[9] R. Borndörfer,et al. Aspects of Set Packing, Partitioning, and Covering , 1998 .
[10] Panos M. Pardalos,et al. The maximum clique problem , 1994, J. Glob. Optim..
[11] Leslie E. Trotter,et al. Properties of vertex packing and independence system polyhedra , 1974, Math. Program..
[12] Bert Gerards,et al. Matrices with the edmonds—Johnson property , 1986, Comb..
[13] Manfred W. Padberg,et al. On the facial structure of set packing polyhedra , 1973, Math. Program..
[14] David S. Johnson,et al. Cliques, Coloring, and Satisfiability , 1996 .
[15] R. D. Young. A Simplified Primal (All-Integer) Integer Programming Algorithm , 1968, Oper. Res..
[16] L. Lovász,et al. Geometric Algorithms and Combinatorial Optimization , 1981 .