The bounded simplex method to solve the 0-1 linear integer programming problem (Q5260302)
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: The bounded simplex method to solve the 0-1 linear integer programming problem |
scientific article; zbMATH DE number 6453680
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | The bounded simplex method to solve the 0-1 linear integer programming problem |
scientific article; zbMATH DE number 6453680 |
Statements
29 June 2015
0 references
0-1 programming
0 references
bounded simplex method
0 references
pivoting iteration
0 references
0.7494868040084839
0 references
