A computational study of parametric tabu search for 0-1 mixed integer programs (Q709185)
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 computational study of parametric tabu search for 0-1 mixed integer programs |
scientific article; zbMATH DE number 5800833
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | A computational study of parametric tabu search for 0-1 mixed integer programs |
scientific article; zbMATH DE number 5800833 |
Statements
A computational study of parametric tabu search for 0-1 mixed integer programs (English)
0 references
15 October 2010
0 references
mixed integer programming
0 references
penalized branching
0 references
tabu search
0 references
heuristics
0 references
0 references
0 references
0.8969555497169495
0 references
0.8173977136611938
0 references
0.7924371957778931
0 references
