Bayesian stopping rules for greedy randomized procedures

DOI10.1007/s10898-006-9014-3zbMath1120.90072OpenAlexW1996469279MaRDI QIDQ2433924

Carlotta Orsenigo, Carlo Vercellis

Publication date: 31 October 2006

Published in: Journal of Global Optimization (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10898-006-9014-3

zbMATH Keywords

GRASPHeuristicsBayesian stopping rulesMixed binary programming

Mathematics Subject Classification ID

Mixed integer programming (90C11) Approximation methods and heuristics in mathematical programming (90C59)

Related Items (1)

Probabilistic stopping rules for GRASP heuristics and extensions

Uses Software

• GRASP
• UCI-ml

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Discrete support vector decision trees via tabu search
• Optimal and sub-optimal stopping rules for the multistart algorithm in global optimization
• Greedy randomized adaptive search procedures
• Local search with perturbations for the prize-collecting Steiner tree problem in graphs
• Bayesian stopping rules for multistart global optimization methods
• Bayesian nonparametrie inference and monte carlo optimization
• Sequential stopping rules for the multistart algorithm in global optimisation
• Sequential Stopping Rules for Random Optimization Methods with Applications to Multistart Local Search
• Reactive GRASP: An Application to a Matrix Decomposition Problem in TDMA Traffic Assignment
• Multivariate classification trees based on minimum features discrete support vector machines

This page was built for publication: Bayesian stopping rules for greedy randomized procedures