메뉴 건너뛰기




Volumn 1, Issue 5, 1982, Pages 201-205

Approximate algorithms for the travelling purchaser problem

Author keywords

algorithms; heuristics; Travelling purchaser problem; travelling salesman problem

Indexed keywords


EID: 0012137682     PISSN: 01676377     EISSN: None     Source Type: Journal    
DOI: 10.1016/0167-6377(82)90041-4     Document Type: Article
Times cited : (37)

References (11)
  • 6
    • 84909539501 scopus 로고
    • Two generalizations of the travelling salesman problem
    • University of Maryland, College Park, MD
    • (1980) Working Paper , pp. 20742
    • Golden1    Levy2    Dahl3
  • 9
  • 10
    • 84909539500 scopus 로고
    • Travelling purchases problem
    • Department of Mathematics, Regional Engineering College, Warangal, 506004
    • (1978) Working Paper
    • Ramesh1
  • 11
    • 0019151069 scopus 로고
    • Using multidimensional scaling to solve travelling salesman and machine scheduling problems
    • (1980) Operations Res. , vol.7 , pp. 177-184
    • White1    Sweeney2


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