Matrix cones, projection representations, and stable set polyhedra
作者： László Lovász , Alexander Schrijver
DOI:
关键词:
摘要:
参考文章(11)
Nelson Maculan, The Steiner Problem in Graphs North-holland Mathematics Studies. ,vol. 132, pp. 185- 211 ,(1987) , 10.1016/S0304-0208(08)73236-5
Mihalis Yannakakis, Expressing combinatorial optimization problems by linear programs symposium on the theory of computing. pp. 223- 228 ,(1988) , 10.1145/62212.62232
Ralph E. Gomory, Outline of an algorithm for integer solutions to linear programs Bulletin of the American Mathematical Society. ,vol. 64, pp. 275- 278 ,(1958) , 10.1090/S0002-9904-1958-10224-4
M. Grötschel, L. Lovász, A. Schrijver, The ellipsoid method and its consequences in combinatorial optimization Combinatorica. ,vol. 1, pp. 169- 197 ,(1981) , 10.1007/BF02579273
M Grötschel, L Lovász, A Schrijver, Relaxations of vertex packing Journal of Combinatorial Theory, Series B. ,vol. 40, pp. 330- 343 ,(1986) , 10.1016/0095-8956(86)90087-0
Egon Balas, William Pulleyblank, The perfectly matchable subgraph polytope of a bipartite graph Networks. ,vol. 13, pp. 495- 516 ,(1983) , 10.1002/NET.3230130405
Hanif D. Sherali, Warren P. Adams, A hierarchy of relaxation between the continuous and convex hull representations SIAM Journal on Discrete Mathematics. ,vol. 3, pp. 411- 430 ,(1990) , 10.1137/0403036
V Chvátal, On certain polytopes associated with graphs Journal of Combinatorial Theory, Series B. ,vol. 18, pp. 138- 154 ,(1975) , 10.1016/0095-8956(75)90041-6
Martin Grötschel, László Lovász, Alexander Schrijver, Geometric Algorithms and Combinatorial Optimization ,(1988)
V. Chvátal, Edmonds polytopes and a hierarchy of combinatorial problems Discrete Mathematics. ,vol. 306, pp. 305- 337 ,(1973) , 10.1016/0012-365X(73)90167-2