Probabilistic subproblem selection in branch-and-bound algorithms (Q557739)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Probabilistic subproblem selection in branch-and-bound algorithms |
scientific article; zbMATH DE number 2184005
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Probabilistic subproblem selection in branch-and-bound algorithms |
scientific article; zbMATH DE number 2184005 |
Statements
Probabilistic subproblem selection in branch-and-bound algorithms (English)
0 references
30 June 2005
0 references
The authors propose to include a probabilistic element into the selection process of the subproblem in branch-and-bound algorithms. The proposed method is a generalization of the best-bound selection rule. Also, they give conditions which guarantee that the branch-and-bound algorithm converges with probability \(1\), using the probabilistic selection rule proposed by the authors. Numerical experiments on the maximum clique problem are given.
0 references
Nonconvex programming
0 references
Subset selection in branch-and-bound algorithms
0 references
Convergence
0 references
numerical experiments
0 references
0 references
0 references
0 references
0 references
0 references
