Finite checkability for integer rounding properties in combinatorial programming problems (Q3929541): Difference between revisions
From MaRDI portal
Created a new Item |
Added link to MaRDI item. |
||
| links / mardi / name | links / mardi / name | ||
Revision as of 22:10, 5 February 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Finite checkability for integer rounding properties in combinatorial programming problems |
scientific article |
Statements
Finite checkability for integer rounding properties in combinatorial programming problems (English)
0 references
1982
0 references
integer round-up property
0 references
integer round-down property
0 references
Fulkerson's pluperfect graph theorem
0 references
combinatorial optimization
0 references
finite verification process
0 references
