Geometry, Complexity, and Combinatorics of Permutation Polytopes
暂无分享,去创建一个
[1] A. Vershik,et al. Convex hulls of orbits of representations of finite groups and combinatorial optimization , 1988 .
[2] Peter Kleinschmidt,et al. On the diameter of convex polytopes , 1992, Discret. Math..
[3] L. Mirsky,et al. Results and problems in the theory of doubly-stochastic matrices , 1963 .
[4] B. Sturmfels. Oriented Matroids , 1993 .
[5] A. Bonato,et al. Graphs and Hypergraphs , 2021, Clustering.
[6] G. C. Shephard,et al. Convex Polytopes , 1969, The Mathematical Gazette.
[7] Christos H. Papadimitriou,et al. The adjacency relation on the traveling salesman polytope is NP-Complete , 1978, Math. Program..
[8] Richard A. Brualdi,et al. The assignment polytope , 1976, Math. Program..
[9] M. R. Rao,et al. The travelling salesman problem and a class of polyhedra of diameter two , 1974, Math. Program..
[10] A. Brøndsted. An Introduction to Convex Polytopes , 1982 .
[11] Gil Kalai,et al. Symmetric matroids , 1990, J. Comb. Theory, Ser. B.
[12] Wojciech Szatzschneider,et al. An Inequality , 1991, SIAM Rev..
[13] William R. Pulleyblank,et al. Hamiltonicity in (0-1)-polyhedra , 1984, J. Comb. Theory, Ser. B.
[14] R. Brualdi,et al. Convex polyhedra of doubly stochastic matrices—IV , 1976 .
[15] Richard A. Brualdi,et al. Convex polyhedra of doubly stochastic matrices: II. Graph of Omegan , 1977, J. Comb. Theory, Ser. B.
[16] Michel Las Vergnas,et al. Convexity in oriented matroids , 1980, J. Comb. Theory B.
[17] Jim Lawrence,et al. Oriented matroids , 1978, J. Comb. Theory B.
[18] A. Barvinok,et al. Combinatorial complexity of orbits in representations of the symmetric group , 1992 .
[19] Denis Naddef,et al. The hirsch conjecture is true for (0, 1)-polytopes , 1989, Mathematical programming.
[20] Joseph P. S. Kung,et al. A source book in matroid theory , 1985 .