메뉴 건너뛰기




Volumn 207, Issue 3, 2010, Pages 1227-1234

A heuristic procedure for the Capacitated m-Ring-Star problem

Author keywords

Capacitated m Ring Star problem; Heuristic algorithms; Networks

Indexed keywords

CAPACITATED M-RING-STAR PROBLEM; COMMUNICATION NETWORKS; COMPUTATIONAL EXPERIMENT; COMPUTING TIME; CONSTRUCTION PHASE; HEURISTIC PROCEDURES; INPUT PARAMETER; LOCAL OPTIMA; LOCAL SEARCH; NETWORKS; NODE-DISJOINT; NP-HARD; NUMBER OF ITERATIONS; OPTIMAL SOLUTIONS;

EID: 77957707984     PISSN: 03772217     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.ejor.2010.06.030     Document Type: Article
Times cited : (32)

References (10)
  • 3
    • 0031144089 scopus 로고    scopus 로고
    • A branch-and-cut algorithm for the symmetric generalized traveling salesman problem
    • M. Fischetti, J.J. Salazar González, and P. Toth A branch-and-cut algorithm for the symmetric generalized traveling salesman problem Operations Research 45 1997 378 394
    • (1997) Operations Research , vol.45 , pp. 378-394
    • Fischetti, M.1    Salazar González, J.J.2    Toth, P.3
  • 4
    • 0034301999 scopus 로고    scopus 로고
    • Effective implementation of the Lin-Kerninghan traveling salesman heuristic
    • K. Helsgaum Effective implementation of the Lin-Kerninghan traveling salesman heuristic European Journal of Operational Research 126 2000 106 130
    • (2000) European Journal of Operational Research , vol.126 , pp. 106-130
    • Helsgaum, K.1
  • 8
    • 0015604699 scopus 로고
    • An effective heuristic algorithm for the traveling salesman problem
    • S. Lin, and BW. Kernighan An effective heuristic algorithm for the traveling salesman problem Operations Research 20 1973 498 516
    • (1973) Operations Research , vol.20 , pp. 498-516
    • Lin, S.1    Kernighan, B.W.2
  • 10
    • 0026225350 scopus 로고
    • A traveling salesman problem library
    • G. Reinelt A traveling salesman problem library ORSA Journal on Computing 3 1991 376 384
    • (1991) ORSA Journal on Computing , vol.3 , pp. 376-384
    • Reinelt, G.1


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