A dual heuristic for mixed integer programming (Q1785392)
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 dual heuristic for mixed integer programming |
scientific article; zbMATH DE number 6945380
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | A dual heuristic for mixed integer programming |
scientific article; zbMATH DE number 6945380 |
Statements
A dual heuristic for mixed integer programming (English)
0 references
28 September 2018
0 references
dual heuristic
0 references
branch-and-bound
0 references
knapsack
0 references
relaxations
0 references
0 references
0.7762047648429871
0 references
0.7505362033843994
0 references
0.7502761483192444
0 references
0.7499338984489441
0 references
0.7483945488929749
0 references
