Estimating optimal stopping rules in the multiple best choice problem with minimal summarized rank via the cross-entropy method
Abstract
References
Recommendations
Hybridizing the cross-entropy method: An application to the max-cut problem
Cross-entropy has been recently proposed as a heuristic method for solving combinatorial optimization problems. We briefly review this methodology and then suggest a hybrid version with the goal of improving its performance. In the context of the well-...
Effective probabilistic stopping rules for randomized metaheuristics: GRASP implementations
LION'05: Proceedings of the 5th international conference on Learning and Intelligent OptimizationThe main drawback of most metaheuristics is the absence of effective stopping criteria. Most implementations stop after performing a given maximum number of iterations or a given maximum number of consecutive iterations without improvement in the best ...
Bayesian Stopping Rules for Greedy Randomized Procedures
A greedy randomized adaptive search procedure (GRASP) is proposed for the approximate solution of general mixed binary programming problems (MBP). Examples are provided of practical applications that can be formulated as MBP requiring the solution of a ...
Comments
Information & Contributors
Information
Published In
Publisher
IEEE Press
Publication History
Qualifiers
- Article
Contributors
Other Metrics
Bibliometrics & Citations
Bibliometrics
Article Metrics
- 0Total Citations
- 0Total Downloads
- Downloads (Last 12 months)0
- Downloads (Last 6 weeks)0
Other Metrics
Citations
View Options
View options
Get Access
Login options
Check if you have access through your login credentials or your institution to get full access on this article.
Sign in