SCOPUS 정보 검색 플랫폼

Volumn 30, Issue 2, 2002, Pages 97-99

Anti-matroids

Author keywords

Assignment problem; Combinatorial optimization; Greedy algorithm; Matroids; TSP

Indexed keywords

ALGORITHMS; COMBINATORIAL MATHEMATICS; POLYNOMIALS; THEOREM PROVING; TRAVELING SALESMAN PROBLEM;

COMBINATORIAL ALGORITHMS;

SET THEORY;

EID: 0036543857 PISSN: 01676377 EISSN: None Source Type: Journal
DOI: 10.1016/S0167-6377(02)00117-7 Document Type: Article

Times cited : (8)

References (9)

1
- 0035305859
- TSP tour domination and Hamilton cycle decompositions of regular digraphs
- (2001) Oper. Res. Lett. , vol.28 , pp. 107-111
- Gutin, G.¹ Yeo, A.²

2
- 84867953589
- Polynomial approximation algorithms for the TSP and the QAP with a factorial domination number
- (2002) Discrete Appl. Math. , vol.119 , pp. 107-116
- Gutin, G.¹ Yeo, A.²

3
- 84867972837
- Traveling salesman should not be greedy: Domination analysis of greedy-type heuristics for the TSP
- (2002) Discrete Appl. Math. , vol.117 , pp. 81-86
- Gutin, G.¹ Yeo, A.² Zverovich, A.³

4
- 0942303484
- Exponential neighborhoods and domination analysis for the TSP
- G. Gutin, A. Punnen (Eds.), Kluwer Academic Publishers, Dordrecht
- (2002) The Traveling Salesman Problem and its Variations
- Gutin, G.¹ Yeo, A.² Zverovich, A.³

5
- 0004061262
- Oxford University Press, Oxford
- (1992) Matroid Theory
- Oxley, J.¹

6
- 84867965201
- Domination analysis of some heuristics for the asymmetric traveling salesman problem
- (2002) Discrete Appl. Math. , vol.119 , pp. 117-128
- Punnen, A.¹ Kabadi, S.²

8
- 0009617394
- Estimates of the accuracy of procedures in the traveling salesman problem
- in Russian
- (1973) Numer. Math. Comput. Technol. , vol.4 , pp. 18-23
- Rublineckii, V.I.¹

9
- 0009600634
- On the minimization of a linear from on a set of all n-elements cycles
- in Russian
- (1976) Vestsi Akad. Navuk B SSR Ser. Fiz.-Mat. Navuk , vol.4 , pp. 17-21
- Sarvanov, V.I.¹

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