메뉴 건너뛰기




Volumn 4, Issue 4, 2000, Pages 395-414

Some Results on Node Lifting of TSP Inequalities

Author keywords

Inequalities; Lifting; Node lifting; Polytope; Traveling salesman problem

Indexed keywords


EID: 0041686616     PISSN: 13826905     EISSN: None     Source Type: Journal    
DOI: 10.1023/A:1009830409833     Document Type: Article
Times cited : (3)

References (10)
  • 2
    • 0031142588 scopus 로고    scopus 로고
    • Separating clique trees and bipartition inequalities having a fixed number of handles and teeth in polynomial time
    • R. Carr, "Separating clique trees and bipartition inequalities having a fixed number of handles and teeth in polynomial time," Mathematics of Operations Research, vol. 22, no. 2, pp. 257-265, 1997.
    • (1997) Mathematics of Operations Research , vol.22 , Issue.2 , pp. 257-265
    • Carr, R.1
  • 4
    • 0042947709 scopus 로고    scopus 로고
    • Ph.D. Thesis, Department of Mathematics, Carnegie Mellon University
    • G. Christopher, Ph.D. Thesis, Department of Mathematics, Carnegie Mellon University, 1997.
    • (1997)
    • Christopher, G.1
  • 5
    • 4243891359 scopus 로고
    • On the monotone symmetric travelling salesman problem: Hypohamiltonian/hypotraceable graphs and facets
    • M. Grötschel, "On the monotone symmetric travelling salesman problem: Hypohamiltonian/hypotraceable graphs and facets," Mathematics of Operations Research, vol. 5, pp. 285-292, 1980.
    • (1980) Mathematics of Operations Research , vol.5 , pp. 285-292
    • Grötschel, M.1
  • 6
    • 0002737249 scopus 로고
    • Computational complexity
    • E.L. Lawler, J.K. Lenstra, A.H.G. Rinnooy Kan, and D.B. Shmoys (Eds.), John Wiley & Sons, Chichester
    • D.S. Johnson and C.H. Papadimitriou, "Computational complexity," in The Traveling Salesman Problem, E.L. Lawler, J.K. Lenstra, A.H.G. Rinnooy Kan, and D.B. Shmoys (Eds.), John Wiley & Sons, Chichester, 1985, pp. 37-85.
    • (1985) The Traveling Salesman Problem , pp. 37-85
    • Johnson, D.S.1    Papadimitriou, C.H.2
  • 7
    • 77957083042 scopus 로고
    • The traveling salesman problem
    • M.O. Ball et al. (Eds.), Elsevier Science B.V.
    • M. Jünger, G. Reinelt, and G. Rinaldi, "The traveling salesman problem," in Handbooks in OR & MS, vol. 7, M.O. Ball et al. (Eds.), Elsevier Science B.V., 1995.
    • (1995) Handbooks in or & MS , vol.7
    • Jünger, M.1    Reinelt, G.2    Rinaldi, G.3
  • 8
    • 0000803599 scopus 로고
    • The binested inequalities for the symmetric traveling salesman polytope
    • Nov.
    • D. Naddef, "The binested inequalities for the symmetric traveling salesman polytope," Mathematics of Operations Research, vol. 17, no. 4, Nov., 1992.
    • (1992) Mathematics of Operations Research , vol.17 , Issue.4
    • Naddef, D.1
  • 9
    • 0027911602 scopus 로고
    • The graphical relaxation: A new framework for the symmetric traveling salesman polytope
    • D. Naddef and G. Rinaldi, "The graphical relaxation: A new framework for the symmetric traveling salesman polytope," Mathematical Programming, vol. 58, pp. 53-88, 1992.
    • (1992) Mathematical Programming , vol.58 , pp. 53-88
    • Naddef, D.1    Rinaldi, G.2
  • 10
    • 0010690078 scopus 로고
    • A branch-and-cut approach to a travelling salesman problem with side constraints
    • M. Padberg and G. Rinaldi, "A branch-and-cut approach to a travelling salesman problem with side constraints," Management Sci., vol. 35, no. 11, pp. 1393-1412, 1989.
    • (1989) Management Sci. , vol.35 , Issue.11 , pp. 1393-1412
    • Padberg, M.1    Rinaldi, G.2


* 이 정보는 Elsevier사의 SCOPUS DB에서 KISTI가 분석하여 추출한 것입니다.