Predicting the Solution Time of Branch-and-Bound Algorithms for Mixed-Integer Programs (Q2899130): Difference between revisions
From MaRDI portal
Created a new Item |
Set OpenAlex properties. |
||
| (4 intermediate revisions by 3 users not shown) | |||
| Property / describes a project that uses | |||
| Property / describes a project that uses: MIPLIB2003 / rank | |||
Normal rank | |||
| Property / describes a project that uses | |||
| Property / describes a project that uses: MIPLIB / rank | |||
Normal rank | |||
| Property / MaRDI profile type | |||
| Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2135937941 / rank | |||
Normal rank | |||
| links / mardi / name | links / mardi / name | ||
Revision as of 01:54, 20 March 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Predicting the Solution Time of Branch-and-Bound Algorithms for Mixed-Integer Programs |
scientific article |
Statements
Predicting the Solution Time of Branch-and-Bound Algorithms for Mixed-Integer Programs (English)
0 references
28 July 2012
0 references
time prediction
0 references
mixed-integer programming
0 references
branch-and-bound algorithm
0 references
