메뉴 건너뛰기




Volumn 36, Issue 3, 2006, Pages 365-377

Bayesian stopping rules for greedy randomized procedures

Author keywords

Bayesian stopping rules; GRASP; Heuristics; Mixed binary programming

Indexed keywords

APPROXIMATION THEORY; COMPUTATIONAL COMPLEXITY; COMPUTATIONAL METHODS; GLOBAL OPTIMIZATION; HEURISTIC METHODS; NUMERICAL ANALYSIS;

EID: 33748296173     PISSN: 09255001     EISSN: 15732916     Source Type: Journal    
DOI: 10.1007/s10898-006-9014-3     Document Type: Article
Times cited : (5)

References (18)
  • 1
    • 0023393088 scopus 로고
    • Sequential stopping rules for the multistart algorithm in global optimisation
    • Betrò, B., Schoen, F.: Sequential stopping rules for the multistart algorithm in global optimisation. Math. Program. 38, 271-286 (1987)
    • (1987) Math. Program. , vol.38 , pp. 271-286
    • Betrò, B.1    Schoen, F.2
  • 2
    • 0027114543 scopus 로고
    • Optimal and suboptimal stopping rules for the multistart algorithm in global optimisation
    • Betrò, B., Schoen, F.: Optimal and suboptimal stopping rules for the multistart algorithm in global optimisation. Math. Program. 57, 445-458 (1992)
    • (1992) Math. Program. , vol.57 , pp. 445-458
    • Betrò, B.1    Schoen, F.2
  • 3
    • 33748329652 scopus 로고
    • Bayesian nonparametric inference and Monte Carlo optimization
    • Betrò, B., Vercellis, C.: Bayesian nonparametric inference and Monte Carlo optimization. Optimization 17, 681-694 (1986)
    • (1986) Optimization , vol.17 , pp. 681-694
    • Betrò, B.1    Vercellis, C.2
  • 4
    • 0023293769 scopus 로고
    • Bayesian stopping rules for multistart global optimization methods
    • Boender, C., Rinnooy Kan, A.: Bayesian stopping rules for multistart global optimization methods. Math. Program. 37, 59-80 (1987)
    • (1987) Math. Program. , vol.37 , pp. 59-80
    • Boender, C.1    Rinnooy Kan, A.2
  • 6
    • 0035633186 scopus 로고    scopus 로고
    • Local search with perturbations for the prize-collecting steiner tree problem in graphs
    • Canuto, S., Resende, M., Ribeiro, C.: Local search with perturbations for the prize-collecting steiner tree problem in graphs. Networks 38, 50-58 (2001)
    • (2001) Networks , vol.38 , pp. 50-58
    • Canuto, S.1    Resende, M.2    Ribeiro, C.3
  • 7
    • 0000049494 scopus 로고
    • Greedy randomized adaptative search procedures
    • Feo, T., Resende, M.: Greedy randomized adaptative search procedures. J. Global Optimiz. 6, 109-133 (1995)
    • (1995) J. Global Optimiz. , vol.6 , pp. 109-133
    • Feo, T.1    Resende, M.2
  • 9
    • 0030284990 scopus 로고    scopus 로고
    • Capacity management through lagrangean relaxation: An application to tires production
    • Fumero, F., Vercellis, C.: Capacity management through lagrangean relaxation: an application to tires production. Prod. Plan. Control 7, 604-614 (1996)
    • (1996) Prod. Plan. Control , vol.7 , pp. 604-614
    • Fumero, F.1    Vercellis, C.2
  • 10
    • 0031095818 scopus 로고    scopus 로고
    • Integrating distribution, lot-sizing and machine loading via lagrangean relaxation
    • Fumero, F., Vercellis, C.: Integrating distribution, lot-sizing and machine loading via lagrangean relaxation. Int. J. Prod. Econ. 49, 45-54 (1997)
    • (1997) Int. J. Prod. Econ. , vol.49 , pp. 45-54
    • Fumero, F.1    Vercellis, C.2
  • 11
    • 0032237525 scopus 로고    scopus 로고
    • Sequential stopping rules for random optimization methods with applications to multistart local search
    • Hart, W.: Sequential stopping rules for random optimization methods with applications to multistart local search. SIAM J. Optimiz. 9, 270-290 (1999)
    • (1999) SIAM J. Optimiz. , vol.9 , pp. 270-290
    • Hart, W.1
  • 13
    • 1642263475 scopus 로고    scopus 로고
    • Multi variate classification frees based on minimum features discrete support vector machines
    • Orsenigo, C., Vercellis, C.: Multi variate classification frees based on minimum features discrete support vector machines. IMA J. Manage. Math. 14, 221-234 (2003)
    • (2003) IMA J. Manage. Math. , vol.14 , pp. 221-234
    • Orsenigo, C.1    Vercellis, C.2
  • 14
    • 4444351215 scopus 로고    scopus 로고
    • Discrete support vector decision trees via tabu-search
    • Orsenigo, C., Vercellis, C.: Discrete support vector decision trees via tabu-search. J. Comput. Stat. Data Anal. 47, 311-322 (2004a)
    • (2004) J. Comput. Stat. Data Anal. , vol.47 , pp. 311-322
    • Orsenigo, C.1    Vercellis, C.2
  • 15
    • 2942696665 scopus 로고    scopus 로고
    • One-against-all multicategory classification via discrete support vector machines
    • Ebecken N. et al. (eds.) WIT Press
    • Orsenigo, C., Vercellis, C.: One-against-all multicategory classification via discrete support vector machines. In: Ebecken N. et al. (eds.) Data Mining IV. pp. 255-264. WIT Press (2004b)
    • (2004) Data Mining IV , pp. 255-264
    • Orsenigo, C.1    Vercellis, C.2
  • 16
    • 0013132075 scopus 로고    scopus 로고
    • Reactive grasp: An application to a matrix decomposition problem in TDMA traffic assignment
    • Prais, M., Ribeiro, C.: Reactive grasp: An application to a matrix decomposition problem in TDMA traffic assignment. INFORMS J. Comput. 12, 164-176 (2000)
    • (2000) INFORMS J. Comput. , vol.12 , pp. 164-176
    • Prais, M.1    Ribeiro, C.2


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