Vytlačiť
1. A greedy algorithm for solving of convex programming problems and connection with polysatroid theory
| SYS | c109176 | |
|---|---|---|
| LBL | ^^^^^nam^^22^^^^^^^^450^ | |
| 005 | 20181203150305.4 | |
| 100 | $a 19990503d1984 m y0sloc0103 ba | |
| 101 | 0- | $a eng |
| 102 | $a DE | |
| 200 | 1- | $a <A> greedy algorithm for solving of convex programming problems and connection with polysatroid theory $f Galper Morton, R. von Randow, Karl Ringwald |
| 210 | $a Bonn $c Institut für Ökonometrie und Operations Research $d 1984 | |
| 215 | $a 5 s. | |
| 225 | 2- | $a Report $v No. 84336-OR |
| 675 | $a 519.7 $v 1. stred. $z slo $T . $3 eu_un_auth*h0000242 $x Matematická kybernetika | |
| 700 | -1 | $a Morton $b Galper $3 eu_un_auth*p0033505 $4 070 |
| 701 | -1 | $a Randow $b R. von $3 eu_un_auth*p0054279 $4 070 |
| 701 | -1 | $a Ringwald $b Karl $3 eu_un_auth*p0043521 $4 070 |
| 801 | -0 | $a SK $b BA004 $c 19990503 $g AACR2 |