A Monte-Carlo approach for 0-1 programming problems (Q1195974)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 86188
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | A Monte-Carlo approach for 0-1 programming problems |
scientific article; zbMATH DE number 86188 |
Statements
A Monte-Carlo approach for 0-1 programming problems (English)
0 references
11 January 1993
0 references
A two-phase global random search procedure for solving NP-hard \(0-1\) optimization problems, in which both the feasible domains and the objective functions are described by algebraic separable functions, is proposed. The quality of the random search results is derived from analysis of non-asymptotic order statistics and distribution-free intervals. Computational experiments on linear \(0-1\) multi-knapsack problems are presented showing that the procedure can obtain a solution within a few percentage from the true optimal solution.
0 references
Monte-Carlo search
0 references
discrete optimization
0 references
computational experiments
0 references
two-phase global random search procedure
0 references
NP-hard \(0-1\) optimization problems
0 references
order statistics
0 references
linear \(0-1\) multi-knapsack problems
0 references
0.7475451827049255
0 references
0.7454000115394592
0 references
0.7450482249259949
0 references
0.7441156506538391
0 references
