Superadditive characterizations of pure integer programming feasibility (Q5963699)
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: Superadditive characterizations of pure integer programming feasibility |
scientific article; zbMATH DE number 6544388
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Superadditive characterizations of pure integer programming feasibility |
scientific article; zbMATH DE number 6544388 |
Statements
Superadditive characterizations of pure integer programming feasibility (English)
0 references
23 February 2016
0 references
integer programming feasibility
0 references
superadditive duality
0 references
Farkas' lemma
0 references
0.7606531381607056
0 references
0.7310352325439453
0 references
0.7281940579414368
0 references
