Comparisons of commercial MIP solvers and an adaptive memory (tabu search) procedure for a class of 0-1 integer programming problems (Q2865877)
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: Comparisons of commercial MIP solvers and an adaptive memory (tabu search) procedure for a class of 0-1 integer programming problems |
scientific article; zbMATH DE number 6237554
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Comparisons of commercial MIP solvers and an adaptive memory (tabu search) procedure for a class of 0-1 integer programming problems |
scientific article; zbMATH DE number 6237554 |
Statements
11 December 2013
0 references
zero-one integer programming
0 references
Boolean optimization
0 references
commercial solvers
0 references
metaheuristics
0 references
Comparisons of commercial MIP solvers and an adaptive memory (tabu search) procedure for a class of 0-1 integer programming problems (English)
0 references
0.7805979251861572
0 references
0.750586211681366
0 references
0.7450701594352722
0 references
0.7450177669525146
0 references
0.7437208890914917
0 references
