Strong-Cut Enumerative procedure for Extreme point Mathematical Programming Problems (Q5675137): Difference between revisions
From MaRDI portal
Added link to MaRDI item. |
Set OpenAlex properties. |
||
| (One intermediate revision by one other user not shown) | |||
| Property / cites work | |||
| Property / cites work: Q3285991 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Extreme Point Mathematical Programming / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Q5671797 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Strong-Cut Enumerative procedure for Extreme point Mathematical Programming Problems / rank | |||
Normal rank | |||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1007/bf01956854 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2019907950 / rank | |||
Normal rank | |||
Latest revision as of 10:57, 30 July 2024
scientific article; zbMATH DE number 3410782
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Strong-Cut Enumerative procedure for Extreme point Mathematical Programming Problems |
scientific article; zbMATH DE number 3410782 |
Statements
Strong-Cut Enumerative procedure for Extreme point Mathematical Programming Problems (English)
0 references
1973
0 references
