Improving the efficiency of the branch and bound algorithm for integer programming based on ``flatness'' information (Q858332)
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: Improving the efficiency of the branch and bound algorithm for integer programming based on ``flatness information |
scientific article; zbMATH DE number 5082780
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Improving the efficiency of the branch and bound algorithm for integer programming based on ``flatness'' information |
scientific article; zbMATH DE number 5082780 |
Statements
Improving the efficiency of the branch and bound algorithm for integer programming based on ``flatness'' information (English)
0 references
9 January 2007
0 references
discrete optimization
0 references
Branch and Bound
0 references
0 references
0 references
0.8634504675865173
0 references
0.7993192076683044
0 references
0.7733350396156311
0 references
0.76295006275177
0 references
