An algorithm for finding the shortest element of a polyhedral set with application to Lagrangian duality (Q1248461)
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: An algorithm for finding the shortest element of a polyhedral set with application to Lagrangian duality |
scientific article; zbMATH DE number 3596577
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | An algorithm for finding the shortest element of a polyhedral set with application to Lagrangian duality |
scientific article; zbMATH DE number 3596577 |
Statements
An algorithm for finding the shortest element of a polyhedral set with application to Lagrangian duality (English)
0 references
1978
0 references
0 references
