Finite checkability for integer rounding properties in combinatorial programming problems (Q3929541): Difference between revisions
From MaRDI portal
ReferenceBot (talk | contribs) Changed an Item |
Set OpenAlex properties. |
||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1007/bf01581034 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2092751629 / rank | |||
Normal rank | |||
Latest revision as of 08:46, 30 July 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
