What makes integer programming problems hard to solve: An empirical study (Q1254013): Difference between revisions
From MaRDI portal
Removed claim: author (P16): Item:Q204963 |
Changed an Item |
||
| Property / author | |||
| Property / author: Ronald L. Rardin / rank | |||
Normal rank | |||
Revision as of 21:37, 10 February 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | What makes integer programming problems hard to solve: An empirical study |
scientific article |
Statements
What makes integer programming problems hard to solve: An empirical study (English)
0 references
1978
0 references
Empirical Study
0 references
Integer Programming
0 references
Cutting Plane Algorithm
0 references
Branch- And-Bound Algorithms
0 references
Random Test Problems
0 references
