메뉴 건너뛰기




Volumn 7874 LNCS, Issue , 2013, Pages 176-192

Tuning parameters of large neighborhood search for the machine reassignment problem

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHM CONFIGURATIONS; DATA CENTERS; HIGH QUALITY; HUMAN EXPERT; LARGE NEIGHBORHOOD SEARCH; LARGE-SIZED; ONLINE PROBLEMS; TUNING PARAMETER;

EID: 84892931795     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-642-38171-3_12     Document Type: Conference Paper
Times cited : (24)

References (20)
  • 1
    • 33644511374 scopus 로고    scopus 로고
    • Fine-tuning of algorithms using fractional experimental designs and local search
    • Adenso-Diaz, B., Laguna, M.: Fine-tuning of algorithms using fractional experimental designs and local search. Oper. Res. 54(1), 99-114 (2006)
    • (2006) Oper. Res. , vol.54 , Issue.1 , pp. 99-114
    • Adenso-Diaz, B.1    Laguna, M.2
  • 2
    • 70350773809 scopus 로고    scopus 로고
    • A Gender-Based Genetic Algorithm for the Automatic Configuration of Algorithms
    • Gent, I.P. (ed.) CP 2009. Springer, Heidelberg
    • Ansótegui, C., Sellmann, M., Tierney, K.: A Gender-Based Genetic Algorithm for the Automatic Configuration of Algorithms. In: Gent, I.P. (ed.) CP 2009. LNCS, vol. 5732, pp. 142-157. Springer, Heidelberg (2009)
    • (2009) LNCS , vol.5732 , pp. 142-157
    • Ansótegui, C.1    Sellmann, M.2    Tierney, K.3
  • 3
    • 34547930273 scopus 로고    scopus 로고
    • Finding optimal algorithmic parameters using derivative-free optimization
    • Audet, C., Orban, D.: Finding optimal algorithmic parameters using derivative-free optimization. SIAM J. on Optimization 17(3), 642-664 (2006)
    • (2006) SIAM J. on Optimization , vol.17 , Issue.3 , pp. 642-664
    • Audet, C.1    Orban, D.2
  • 4
    • 0035128384 scopus 로고    scopus 로고
    • Using experimental design to find effective parameter settings for heuristics
    • Coy, S.P., Golden, B.L., Runger, G.C., Wasil, E.A.: Using experimental design to find effective parameter settings for heuristics. Journal of Heuristics 7, 77-97 (2001)
    • (2001) Journal of Heuristics , vol.7 , pp. 77-97
    • Coy, S.P.1    Golden, B.L.2    Runger, G.C.3    Wasil, E.A.4
  • 8
    • 80052997439 scopus 로고    scopus 로고
    • Algorithm selection and scheduling
    • Lee, J. (ed.) CP 2011. Springer, Heidelberg
    • Kadioglu, S., Malitsky, Y., Sabharwal, A., Samulowitz, H., Sellmann, M.: Algorithm selection and scheduling. In: Lee, J. (ed.) CP 2011. LNCS, vol. 6876, pp. 454-469. Springer, Heidelberg (2011)
    • (2011) LNCS , vol.6876 , pp. 454-469
    • Kadioglu, S.1    Malitsky, Y.2    Sabharwal, A.3    Samulowitz, H.4    Sellmann, M.5
  • 10
    • 84868282954 scopus 로고    scopus 로고
    • Comparing solution methods for the machine reassignment problem
    • Milano, M. (ed.) CP 2012. Springer, Heidelberg
    • Mehta, D., O'Sullivan, B., Simonis, H.: Comparing solution methods for the machine reassignment problem. In: Milano, M. (ed.) CP 2012. LNCS, vol. 7514, pp. 782-797. Springer, Heidelberg (2012)
    • (2012) LNCS , vol.7514 , pp. 782-797
    • Mehta, D.1    O'Sullivan, B.2    Simonis, H.3
  • 11
    • 70350675971 scopus 로고    scopus 로고
    • Instance-based selection of policies for SAT solvers
    • Kullmann, O. (ed.) SAT 2009. Springer, Heidelberg
    • Nikolić, M., Marić, F., Janičić, P.: Instance-based selection of policies for SAT solvers. In: Kullmann, O. (ed.) SAT 2009. LNCS, vol. 5584, pp. 326-340. Springer, Heidelberg (2009)
    • (2009) LNCS , vol.5584 , pp. 326-340
    • Nikolić, M.1    Marić, F.2    Janičić, P.3
  • 14
    • 38349011818 scopus 로고    scopus 로고
    • A multi-engine solver for quantified boolean formulas
    • Bessière, C. (ed.) CP 2007. Springer, Heidelberg
    • Pulina, L., Tacchella, A.: A multi-engine solver for quantified boolean formulas. In: Bessière, C. (ed.) CP 2007. LNCS, vol. 4741, pp. 574-589. Springer, Heidelberg (2007)
    • (2007) LNCS , vol.4741 , pp. 574-589
    • Pulina, L.1    Tacchella, A.2
  • 15
    • 84957372764 scopus 로고    scopus 로고
    • Using constraint programming and local search methods to solve vehicle routing problems
    • Maher, M., Puget, J.-F. (eds.) CP 1998. Springer, Heidelberg
    • Shaw, P.: Using constraint programming and local search methods to solve vehicle routing problems. In: Maher, M., Puget, J.-F. (eds.) CP 1998. LNCS, vol. 1520, pp. 417-431. Springer, Heidelberg (1998)
    • (1998) LNCS , vol.1520 , pp. 417-431
    • Shaw, P.1
  • 17
    • 51849105715 scopus 로고    scopus 로고
    • Coordinated management of power usage and runtime performance
    • IEEE
    • Steinder, M., Whalley, I., Hanson, J.E., Kephart, J.O.: Coordinated management of power usage and runtime performance. In: NOMS, pp. 387-394. IEEE (2008)
    • (2008) NOMS , pp. 387-394
    • Steinder, M.1    Whalley, I.2    Hanson, J.E.3    Kephart, J.O.4
  • 18
    • 58149091441 scopus 로고    scopus 로고
    • pMapper: Power and migration cost aware application placement in virtualized systems
    • Issarny, V., Schantz, R. (eds.) Middleware 2008. Springer, Heidelberg
    • Verma, A., Ahuja, P., Neogi, A.: pMapper: Power and migration cost aware application placement in virtualized systems. In: Issarny, V., Schantz, R. (eds.) Middleware 2008. LNCS, vol. 5346, pp. 243-264. Springer, Heidelberg (2008)
    • (2008) LNCS , vol.5346 , pp. 243-264
    • Verma, A.1    Ahuja, P.2    Neogi, A.3
  • 20
    • 52249100995 scopus 로고    scopus 로고
    • Satzilla: Portfolio-based algorithm selection for SAT
    • Xu, L., Hutter, F., Hoos, H.H., Leyton-Brown, K.: Satzilla: Portfolio-based algorithm selection for SAT. J. Artif. Int. Res. 32(1), 565-606 (2008)
    • (2008) J. Artif. Int. Res. , vol.32 , Issue.1 , pp. 565-606
    • Xu, L.1    Hutter, F.2    Hoos, H.H.3    Leyton-Brown, K.4


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