Finding feasible solutions to hard mixed-integer programming problems using hybrid heuristics (Q3416573)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 5117499
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Finding feasible solutions to hard mixed-integer programming problems using hybrid heuristics |
scientific article; zbMATH DE number 5117499 |
Statements
22 January 2007
0 references
0.8377712368965149
0 references
0.8291966319084167
0 references
0.7951454520225525
0 references
0.7921566367149353
0 references
0.79059898853302
0 references
