| Reference Type | Journal (article/letter/editorial) |
|---|
| Title | An algorithm for finding the shortest element of a polyhedral set with application to lagrangian duality |
|---|
| Journal | Journal of Mathematical Analysis and Applications |
|---|
| Authors | Bazaraa, Mokhtar S | Author |
|---|
| Goode, Jamie J | Author |
| Rardin, Ronald L | Author |
| Year | 1978 (September) | Volume | 65 |
|---|
| Publisher | Elsevier BV |
|---|
| DOI | doi:10.1016/0022-247x(78)90180-4Search in ResearchGate |
|---|
| Generate Citation Formats |
| Mindat Ref. ID | 12377048 | Long-form Identifier | mindat:1:5:12377048:8 |
|---|
|
| GUID | 0 |
|---|
| Full Reference | Bazaraa, Mokhtar S, Goode, Jamie J, Rardin, Ronald L (1978) An algorithm for finding the shortest element of a polyhedral set with application to lagrangian duality. Journal of Mathematical Analysis and Applications, 65. 278-288 doi:10.1016/0022-247x(78)90180-4 |
|---|
| Plain Text | Bazaraa, Mokhtar S, Goode, Jamie J, Rardin, Ronald L (1978) An algorithm for finding the shortest element of a polyhedral set with application to lagrangian duality. Journal of Mathematical Analysis and Applications, 65. 278-288 doi:10.1016/0022-247x(78)90180-4 |
|---|
| In | (n.d.) Journal of Mathematical Analysis and Applications Vol. 65. Elsevier BV |
|---|
These are possibly similar items as determined by title/reference text matching only.