Nearness and bound relationships between an integer-programming problem and its relaxed linear-programming problem (Q1265040)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Nearness and bound relationships between an integer-programming problem and its relaxed linear-programming problem |
scientific article; zbMATH DE number 1206565
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Nearness and bound relationships between an integer-programming problem and its relaxed linear-programming problem |
scientific article; zbMATH DE number 1206565 |
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
0.89132994
0 references
0.88302976
0 references
0.88100445
0 references
0.8779047
0 references
0.87311006
0 references
0.87019295
0 references
