Nearness and bound relationships between an integer-programming problem and its relaxed linear-programming problem (Q1265040): 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.1023/a:1022632713397 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W106943091 / rank | |||
Normal rank | |||
Latest revision as of 09:55, 30 July 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Nearness and bound relationships between an integer-programming problem and its relaxed linear-programming problem |
scientific article |
Statements
Nearness and bound relationships between an integer-programming problem and its relaxed linear-programming problem (English)
0 references
28 February 1999
0 references
integer programming
0 references
relaxed linear-programming problems
0 references
extreme points
0 references
solution bounds
0 references
