Bayesian Approach to Discrete Optimization
Various heuristics are widely used in discrete optimization. The average results of heuristic optimization can be improved by the randomization and optimization of heuristic parameters using the BHA. Therefore we consider the discrete optimization as the main area of BHA application. The representation of discrete optimization as a multi-stage decision problem is also a convenient way to show how BHA works.
KeywordsDiscrete Optimization Greedy Heuristic Prob Ability Restrict Candidate List Polynomial Randomization
Unable to display preview. Download preview PDF.