Nearness and bound relationships between an integer-programming problem and its relaxed linear-programming problem (Q1265040): Difference between revisions
From MaRDI portal
Set profile property. |
ReferenceBot (talk | contribs) Changed an Item |
||
| Property / cites work | |||
| Property / cites work: Integer Rounding for Polymatroid and Branching Optimization Problems / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Parametric formulation of the general integer linear programming problem / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: All-integer linear programming — a new approach via dynamic programming / rank | |||
Normal rank | |||
Revision as of 15:24, 28 May 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
