Faster integer-feasibility in mixed-integer linear programs by branching to force change (Q632648)
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: Faster integer-feasibility in mixed-integer linear programs by branching to force change |
scientific article; zbMATH DE number 5870569
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Faster integer-feasibility in mixed-integer linear programs by branching to force change |
scientific article; zbMATH DE number 5870569 |
Statements
Faster integer-feasibility in mixed-integer linear programs by branching to force change (English)
0 references
25 March 2011
0 references
mixed-integer programming
0 references
branching
0 references
integer feasibility
0 references
0 references
0.819916307926178
0 references
0.7922316193580627
0 references
0.7827542424201965
0 references
0.7730087637901306
0 references
