An algorithm for finding the shortest element of a polyhedral set with application to Lagrangian duality (Q1248461): Difference between revisions
From MaRDI portal
ReferenceBot (talk | contribs) Changed an Item |
Set OpenAlex properties. |
||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1016/0022-247x(78)90180-4 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2083550175 / rank | |||
Normal rank | |||
Latest revision as of 08:39, 30 July 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | An algorithm for finding the shortest element of a polyhedral set with application to Lagrangian duality |
scientific article |
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
