메뉴 건너뛰기




Volumn 5818 LNCS, Issue , 2009, Pages 171-177

Matheuristics: Optimization, simulation and control

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTATIONAL RESOURCES; EXACT METHODS; HEURISTIC SOLUTIONS; INTEROPERATIONS; META HEURISTICS; MODEL-BASED; OPTIMIZATION PROBLEMS;

EID: 71049176659     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-642-04918-7_13     Document Type: Conference Paper
Times cited : (167)

References (17)
  • 2
    • 0031097803 scopus 로고    scopus 로고
    • An optimized crossover for the maximum independent set
    • Aggarwal, C., Orlin, J., Tai, R.: An optimized crossover for the maximum independent set. Operations Research 45, 226-234 (1997)
    • (1997) Operations Research , vol.45 , pp. 226-234
    • Aggarwal, C.1    Orlin, J.2    Tai, R.3
  • 3
    • 84867980790 scopus 로고    scopus 로고
    • A survey of very large-scale neighborhood search techniques
    • Ahuja, R., Ergun, O., Orlin, J., Punnen, A.: A survey of very large-scale neighborhood search techniques. Discrete Applied Mathematics 123(1-3), 75-102 (2002)
    • (2002) Discrete Applied Mathematics , vol.123 , Issue.1-3 , pp. 75-102
    • Ahuja, R.1    Ergun, O.2    Orlin, J.3    Punnen, A.4
  • 4
    • 64549112632 scopus 로고    scopus 로고
    • Algorithms for the non-bifurcated network design problem
    • Bartolini, E., Mingozzi, A.: Algorithms for the non-bifurcated network design problem. J. of Heuristics 15(3), 259-281 (2009)
    • (2009) J. of Heuristics , vol.15 , Issue.3 , pp. 259-281
    • Bartolini, E.1    Mingozzi, A.2
  • 5
    • 71049173741 scopus 로고    scopus 로고
    • A fully distributed lagrangean metaheuristic for a p2p overlay network design problem
    • Hartl, R. (ed.)
    • Boschetti, M., Jelasity, M., Maniezzo, V.: A fully distributed lagrangean metaheuristic for a p2p overlay network design problem. In: Hartl, R. (ed.) Proceedings MIC 2005 (2005)
    • (2005) Proceedings MIC 2005
    • Boschetti, M.1    Jelasity, M.2    Maniezzo, V.3
  • 6
    • 64549099460 scopus 로고    scopus 로고
    • Benders decomposition, lagrangean relaxation and metaheuristic design
    • Boschetti, M., Maniezzo, V.: Benders decomposition, lagrangean relaxation and metaheuristic design. J. of Heuristics 15(3), 283-312 (2009)
    • (2009) J. of Heuristics , vol.15 , Issue.3 , pp. 283-312
    • Boschetti, M.1    Maniezzo, V.2
  • 7
    • 0013238227 scopus 로고    scopus 로고
    • An iterated dynasearch algorithm for the single-machine total weighted tardiness scheduling problem
    • Congram, R., Potts, C., Van De Velde, S.: An iterated dynasearch algorithm for the single-machine total weighted tardiness scheduling problem. INFORMS Journal on Computing 14(1), 52-67 (2002)
    • (2002) INFORMS Journal on Computing , vol.14 , Issue.1 , pp. 52-67
    • Congram, R.1    Potts, C.2    Van De Velde, S.3
  • 8
    • 84868261947 scopus 로고    scopus 로고
    • Usages of exact algorithms to enhance stochastic local search algorithms
    • Maniezzo, V., Stützle, T., Voss, S. (eds.) OR/CS Interfaces Series. Springer, Heidelberg
    • Dumitrescu, I., Stützle, T.: Usages of exact algorithms to enhance stochastic local search algorithms. In: Maniezzo, V., Stützle, T., Voss, S. (eds.) Matheuristics: Hybridizing metaheuristics and mathematical programming, OR/CS Interfaces Series. Springer, Heidelberg (2009)
    • (2009) Matheuristics: Hybridizing Metaheuristics and Mathematical Programming
    • Dumitrescu, I.1    Stützle, T.2
  • 11
    • 28944448735 scopus 로고    scopus 로고
    • An ant approach to membership overlay design
    • Dorigo, M., Birattari, M., Blum, C., Gambardella, L.M., Mondada, F., Stützle, T. (eds.) ANTS 2004. Springer, Heidelberg
    • Maniezzo, V., Boschetti, M., Jelasity, M.: An ant approach to membership overlay design. In: Dorigo, M., Birattari, M., Blum, C., Gambardella, L.M., Mondada, F., Stützle, T. (eds.) ANTS 2004. LNCS, vol.3172, pp. 37-48. Springer, Heidelberg (2004)
    • (2004) LNCS , vol.3172 , pp. 37-48
    • Maniezzo, V.1    Boschetti, M.2    Jelasity, M.3
  • 13
    • 79955776658 scopus 로고    scopus 로고
    • Matheuristics: Hybridizing metaheuristics and mathematical programming
    • Maniezzo, V., Stützle, T., Voss, S. (eds.) Springer, Heidelberg
    • Maniezzo, V., Stützle, T., Voss, S. (eds.): Matheuristics: Hybridizing Metaheuristics and Mathematical Programming. Annals of Information Systems, vol.10. Springer, Heidelberg (2009)
    • (2009) Annals of Information Systems , vol.10
  • 14
    • 64549095352 scopus 로고    scopus 로고
    • Special issue on mathematical contributions to metaheuristics editorial
    • Maniezzo, V., Voss, S., Hansen, P.: Special issue on mathematical contributions to metaheuristics editorial. Journal of Heuristics 15(3) (2009)
    • (2009) Journal of Heuristics , vol.15 , Issue.3
    • Maniezzo, V.1    Voss, S.2    Hansen, P.3
  • 15
    • 33947275099 scopus 로고    scopus 로고
    • The corridor method: A dynamic programming inspired metaheuristic
    • Sniedovich, M., Voss, S.: The corridor method: a dynamic programming inspired metaheuristic. Control and Cybernetics 35(3), 551-578 (2006)
    • (2006) Control and Cybernetics , vol.35 , Issue.3 , pp. 551-578
    • Sniedovich, M.1    Voss, S.2
  • 17
    • 0030190733 scopus 로고    scopus 로고
    • The use of dynamic programming in genetic algorithms for permutation problems
    • Yagiura, M., Ibaraki, T.: The use of dynamic programming in genetic algorithms for permutation problems. European Journal of Operational Research 92, 387-401 (1996)
    • (1996) European Journal of Operational Research , vol.92 , pp. 387-401
    • Yagiura, M.1    Ibaraki, T.2


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