On packing and covering polyhedra of consecutive ones circulant clutters
暂无分享,去创建一个
[1] G. Cornuéjols,et al. Combinatorial optimization : packing and covering , 2001 .
[2] Annegret K. Wagler. Relaxing Perfectness: Which Graphs Are "Almost" Perfect? , 2002, The Sharpest Cut.
[3] Gabriela R. Argiroffo,et al. On a certain class of nonideal clutters , 2006, Discret. Appl. Math..
[4] F. B. Shepherd. Near-perfect matrices , 1994, Math. Program..
[5] Annegret Wagler,et al. Antiwebs are rank-perfect , 2004, 4OR.
[6] Gérard Cornuéjols,et al. Ideal 0, 1 Matrices , 1994, J. Comb. Theory, Ser. B.
[7] Steven A. Orszag,et al. CBMS-NSF REGIONAL CONFERENCE SERIES IN APPLIED MATHEMATICS , 1978 .
[8] Alfred Lehman,et al. On the width-length inequality , 1979, Math. Program..
[9] F. Bruce Shepherd,et al. Applying Lehman's theorems to packing problems , 1995, Math. Program..
[10] E. Wright,et al. An Introduction to the Theory of Numbers , 1939 .
[11] Arie M. C. A. Koster,et al. The extreme points of QSTAB(G) and its implications , 2006 .
[12] Leslie E. Trotter,et al. A class of facet producing graphs for vertex packing polyhedra , 1975, Discret. Math..
[13] Néstor E. Aguilera. Notes on "Ideal 0, 1 matrices" by Cornuéjols and Novick , 2008, J. Comb. Theory, Ser. B.