Solving Mixed Integer Programming Problems Using Automatic Reformulation (Q4723573)
From MaRDI portal
!
WARNING
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 3995460
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Solving Mixed Integer Programming Problems Using Automatic Reformulation |
scientific article; zbMATH DE number 3995460 |
Statements
Solving Mixed Integer Programming Problems Using Automatic Reformulation (English)
0 references
1987
0 references
computational experience
0 references
mixed 0-1 programming
0 references
strong valid inequalities as cutting planes
0 references
0.8039067387580872
0 references
0.78978031873703
0 references
0.7858386635780334
0 references
0.7805593013763428
0 references
0.7764297723770142
0 references
