A heuristic with tie breaking for certain 0–1 integer programming models (Q3731368)
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 heuristic with tie breaking for certain 0–1 integer programming models |
scientific article; zbMATH DE number 3963567
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | A heuristic with tie breaking for certain 0–1 integer programming models |
scientific article; zbMATH DE number 3963567 |
Statements
A heuristic with tie breaking for certain 0–1 integer programming models (English)
0 references
1985
0 references
heuristic
0 references
0-1 integer linear programming
0 references
gradient-type rule
0 references
tie- breaking
0 references
0.7875078916549683
0 references
0.7723522186279297
0 references
0.7649582028388977
0 references
0.7441210746765137
0 references
0.7233163714408875
0 references
