메뉴 건너뛰기




Volumn , Issue , 2012, Pages 421-426

Tourism-km: A variant of MMKP applied to the tourism domain

Author keywords

Decision support; Knapsack problem; Knowledge management; Simulated annealing

Indexed keywords

COMPUTATIONAL RESULTS; DECISION SUPPORTS; KNAPSACK PROBLEMS; OPERATIONAL RESEARCH; REAL-WORLD PROBLEM;

EID: 84861996596     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper
Times cited : (7)

References (14)
  • 1
    • 26444509453 scopus 로고    scopus 로고
    • Solving the multidimensional multiple-choice knapsack problem by constructing convex hulls
    • Akbar, M., Rahman, M., Kaykobad, M., Manning, E., and Shoja, G. (2006). Solving the multidimensional multiple-choice knapsack problem by constructing convex hulls. Computers and Operations Research, 33(5):12591273.
    • (2006) Computers and Operations Research , vol.33 , Issue.5 , pp. 12591273
    • Akbar, M.1    Rahman, M.2    Kaykobad, M.3    Manning, E.4    Shoja, G.5
  • 3
    • 84861991302 scopus 로고    scopus 로고
    • CHECKSEM (2011). http://www.checksem.fr.
    • (2011)
  • 4
    • 84855534246 scopus 로고    scopus 로고
    • Building an adaptive multimedia system using the utility model
    • Chen, L., Khan, S., Li, K., and Manning, E. (1999). Building an adaptive multimedia system using the utility model. Lecture Notes in Computer Science, 1586:289-298.
    • (1999) Lecture Notes in Computer Science , vol.1586 , pp. 289-298
    • Chen, L.1    Khan, S.2    Li, K.3    Manning, E.4
  • 5
    • 49549086258 scopus 로고    scopus 로고
    • Active3d: Vector of collaboration, between sharing and data exchange
    • Cruz, C. and Nicolle, C. (2006). Active3d: Vector of collaboration, between sharing and data exchange. INFOCOMP, Jounal of Computer Science, 5(3):1-8.
    • (2006) INFOCOMP, Jounal of Computer Science , vol.5 , Issue.3 , pp. 1-8
    • Cruz, C.1    Nicolle, C.2
  • 6
    • 9744219701 scopus 로고    scopus 로고
    • Heuristic algorithms for the multiple-choice multidimensional knapsack problem
    • Hifi, M., Michrafy, M., and Sbihi, A. (2004). Heuristic algorithms for the multiple-choice multidimensional knapsack problem. Journal of Operational Research Society, 55(12):13231332.
    • (2004) Journal of Operational Research Society , vol.55 , Issue.12 , pp. 13231332
    • Hifi, M.1    Michrafy, M.2    Sbihi, A.3
  • 7
    • 33645146389 scopus 로고    scopus 로고
    • A reactive local search-based algorithm for the multiple-choice multi-dimensional knapsack problem
    • Hifi, M., Michrafy, M., and Sbihi, A. (2006). A reactive local search-based algorithm for the multiple-choice multi-dimensional knapsack problem. Computational Optimization and Applications, 33:271-285.
    • (2006) Computational Optimization and Applications , vol.33 , pp. 271-285
    • Hifi, M.1    Michrafy, M.2    Sbihi, A.3
  • 9
  • 12
    • 34848832270 scopus 로고    scopus 로고
    • Multi-period multidimensional knapsack problem and its applications to available-to-promise
    • Hyogo, Japan
    • Lau, H. and Lim, M. (2004). Multi-period multidimensional knapsack problem and its applications to available-to-promise. In Proceedings of the International Symposium on Scheduling (ISS), Hyogo, Japan, page 9499.
    • (2004) Proceedings of the International Symposium on Scheduling (ISS) , pp. 9499
    • Lau, H.1    Lim, M.2


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