A trust branching path heuristic for zero-one programming (Q1014935)
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: A trust branching path heuristic for zero-one programming |
scientific article; zbMATH DE number 5549982
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | A trust branching path heuristic for zero-one programming |
scientific article; zbMATH DE number 5549982 |
Statements
A trust branching path heuristic for zero-one programming (English)
0 references
30 April 2009
0 references
branch and bound
0 references
heuristics
0 references
multiknapsack
0 references
clique
0 references
0 references
0 references
0 references
0.7826041579246521
0 references
0.7652133703231812
0 references
0.7625036835670471
0 references
0.7518588900566101
0 references
