All 0–1 polytopes are traveling salesman polytopes-Reference-Cited by-同舟云学术

All 0–1 polytopes are traveling salesman polytopes

Published:1996-06 Issue:2 Volume:16 Page:175-188
ISSN:0209-9683
Container-title:Combinatorica
language:en
Short-container-title:Combinatorica

Author:

Billera Louis J.,Sarangarajan A.

Publisher

Springer Science and Business Media LLC

Subject

Computational Mathematics,Discrete Mathematics and Combinatorics

Link

http://link.springer.com/content/pdf/10.1007/BF01844844.pdf

Reference8 articles.

1. A. I. Barvinok: Combinatorial complexity of orbits in representations of the symmetric group,Advances in Soviet Mathematics, vol. 9, 1992, pp 161–182.

2. DIMACS Series in Discrete Mathematics and Theoretical Computer Science;L. J. Billera,1996

3. R. Brualdi, andP. Gibson: Convex polyhedra of doubly stochastic matrices, I, II, III,Journal of Combin. Theory, A22 (1977), 192–230; B22 (1977), 175–198; A22 (1977), 338–351.

4. V. A. Emelichev, M. M. Kovalev, andM. K. Kravtsov:Polytopes, Graphs and Optimization, Cambridge University Press, New York, 1984, 211–227.

5. E. L. Lawler, J. K. Lenstra, A. H. G. Rinnooy Kan, andD. B. Shmoys, eds.:The Traveling Salesman Problem: A Guided Tour of Combinatorial Optimization, Wiley, New York, 1985.

Cited by 25 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. Partial Permutation and Alternating Sign Matrix Polytopes;SIAM Journal on Discrete Mathematics;2022-11-15

2. Solving LP Relaxations of Some NP-Hard Problems Is As Hard As Solving Any Linear Program;SIAM Journal on Optimization;2019-01

3. Any Finite Group is the Group of Some Binary, Convex Polytope;Discrete & Computational Geometry;2017-10-23

4. LP Relaxation of the Potts Labeling Problem Is as Hard as Any Linear Program;IEEE Transactions on Pattern Analysis and Machine Intelligence;2017-07-01

5. Semidefinite Approximations of Conical Hulls of Measured Sets;Discrete & Computational Geometry;2016-09-23