Branch-and-bound solves random binary IPs in poly\((n)\)-time (Q6041109)
From MaRDI portal
scientific article; zbMATH DE number 7689171
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Branch-and-bound solves random binary IPs in poly\((n)\)-time |
scientific article; zbMATH DE number 7689171 |
Statements
Branch-and-bound solves random binary IPs in poly\((n)\)-time (English)
0 references
25 May 2023
0 references
random integer programs
0 references
polynomial number of nodes
0 references
0 references
0 references
