Information Journal Paper
APA:
CopyERGAN, O., & ORLIN, L.B.. (2006). A DYNAMIC PROGRAMMING METHODOLOGY IN VERY LARGE SCALE NEIGHBOURHOOD SEARCH APPLIED TO THE TRAVELING SALESMAN PROBLEM. DISCRETE OPTIMIZATION, 3(-), 78-85. SID. https://sid.ir/paper/647636/en
Vancouver:
CopyERGAN O., ORLIN L.B.. A DYNAMIC PROGRAMMING METHODOLOGY IN VERY LARGE SCALE NEIGHBOURHOOD SEARCH APPLIED TO THE TRAVELING SALESMAN PROBLEM. DISCRETE OPTIMIZATION[Internet]. 2006;3(-):78-85. Available from: https://sid.ir/paper/647636/en
IEEE:
CopyO. ERGAN, and L.B. ORLIN, “A DYNAMIC PROGRAMMING METHODOLOGY IN VERY LARGE SCALE NEIGHBOURHOOD SEARCH APPLIED TO THE TRAVELING SALESMAN PROBLEM,” DISCRETE OPTIMIZATION, vol. 3, no. -, pp. 78–85, 2006, [Online]. Available: https://sid.ir/paper/647636/en