Genuinely polynomial simplex and non-simplex algorithms for the minimum cost flow problem:
Gespeichert in:
| Beteilige Person: | |
|---|---|
| Format: | Buch |
| Sprache: | Englisch |
| Veröffentlicht: |
Amsterdam
Centrum voor Wiskunde en Informatica
May 1985
|
| Schriftenreihe: | Report OS
1985,04 |
| Umfang: | 39 Seiten Illustrationen |
Internformat
MARC
| LEADER | 00000nam a2200000 cb4500 | ||
|---|---|---|---|
| 001 | BV049902700 | ||
| 003 | DE-604 | ||
| 007 | t| | ||
| 008 | 241011s1985 xx a||| |||| 00||| eng d | ||
| 035 | |a (OCoLC)1466925773 | ||
| 035 | |a (DE-599)BVBBV049902700 | ||
| 040 | |a DE-604 |b ger |e rda | ||
| 041 | 0 | |a eng | |
| 049 | |a DE-703 | ||
| 084 | |a SI 315 |0 (DE-625)143119: |2 rvk | ||
| 100 | 1 | |a Orlin, James B. |e Verfasser |0 (DE-588)170216128 |4 aut | |
| 245 | 1 | 0 | |a Genuinely polynomial simplex and non-simplex algorithms for the minimum cost flow problem |c J.B. Orlin |
| 246 | 1 | 3 | |a OS-R8504 |
| 264 | 1 | |a Amsterdam |b Centrum voor Wiskunde en Informatica |c May 1985 | |
| 300 | |a 39 Seiten |b Illustrationen | ||
| 336 | |b txt |2 rdacontent | ||
| 337 | |b n |2 rdamedia | ||
| 338 | |b nc |2 rdacarrier | ||
| 490 | 1 | |a Report OS |v 1985,04 | |
| 830 | 0 | |a Report OS |v 1985,04 |w (DE-604)BV010205186 |9 1985,04 | |
| 943 | 1 | |a oai:aleph.bib-bvb.de:BVB01-035241636 | |
Datensatz im Suchindex
| _version_ | 1820961403142406144 |
|---|---|
| adam_text | |
| any_adam_object | |
| author | Orlin, James B. |
| author_GND | (DE-588)170216128 |
| author_facet | Orlin, James B. |
| author_role | aut |
| author_sort | Orlin, James B. |
| author_variant | j b o jb jbo |
| building | Verbundindex |
| bvnumber | BV049902700 |
| classification_rvk | SI 315 |
| ctrlnum | (OCoLC)1466925773 (DE-599)BVBBV049902700 |
| discipline | Mathematik |
| format | Book |
| fullrecord | <?xml version="1.0" encoding="UTF-8"?><collection xmlns="http://www.loc.gov/MARC21/slim"><record><leader>00000nam a2200000 cb4500</leader><controlfield tag="001">BV049902700</controlfield><controlfield tag="003">DE-604</controlfield><controlfield tag="007">t|</controlfield><controlfield tag="008">241011s1985 xx a||| |||| 00||| eng d</controlfield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(OCoLC)1466925773</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(DE-599)BVBBV049902700</subfield></datafield><datafield tag="040" ind1=" " ind2=" "><subfield code="a">DE-604</subfield><subfield code="b">ger</subfield><subfield code="e">rda</subfield></datafield><datafield tag="041" ind1="0" ind2=" "><subfield code="a">eng</subfield></datafield><datafield tag="049" ind1=" " ind2=" "><subfield code="a">DE-703</subfield></datafield><datafield tag="084" ind1=" " ind2=" "><subfield code="a">SI 315</subfield><subfield code="0">(DE-625)143119:</subfield><subfield code="2">rvk</subfield></datafield><datafield tag="100" ind1="1" ind2=" "><subfield code="a">Orlin, James B.</subfield><subfield code="e">Verfasser</subfield><subfield code="0">(DE-588)170216128</subfield><subfield code="4">aut</subfield></datafield><datafield tag="245" ind1="1" ind2="0"><subfield code="a">Genuinely polynomial simplex and non-simplex algorithms for the minimum cost flow problem</subfield><subfield code="c">J.B. Orlin</subfield></datafield><datafield tag="246" ind1="1" ind2="3"><subfield code="a">OS-R8504</subfield></datafield><datafield tag="264" ind1=" " ind2="1"><subfield code="a">Amsterdam</subfield><subfield code="b">Centrum voor Wiskunde en Informatica</subfield><subfield code="c">May 1985</subfield></datafield><datafield tag="300" ind1=" " ind2=" "><subfield code="a">39 Seiten</subfield><subfield code="b">Illustrationen</subfield></datafield><datafield tag="336" ind1=" " ind2=" "><subfield code="b">txt</subfield><subfield code="2">rdacontent</subfield></datafield><datafield tag="337" ind1=" " ind2=" "><subfield code="b">n</subfield><subfield code="2">rdamedia</subfield></datafield><datafield tag="338" ind1=" " ind2=" "><subfield code="b">nc</subfield><subfield code="2">rdacarrier</subfield></datafield><datafield tag="490" ind1="1" ind2=" "><subfield code="a">Report OS</subfield><subfield code="v">1985,04</subfield></datafield><datafield tag="830" ind1=" " ind2="0"><subfield code="a">Report OS</subfield><subfield code="v">1985,04</subfield><subfield code="w">(DE-604)BV010205186</subfield><subfield code="9">1985,04</subfield></datafield><datafield tag="943" ind1="1" ind2=" "><subfield code="a">oai:aleph.bib-bvb.de:BVB01-035241636</subfield></datafield></record></collection> |
| id | DE-604.BV049902700 |
| illustrated | Illustrated |
| indexdate | 2025-01-11T14:02:00Z |
| institution | BVB |
| language | English |
| oai_aleph_id | oai:aleph.bib-bvb.de:BVB01-035241636 |
| oclc_num | 1466925773 |
| open_access_boolean | |
| owner | DE-703 |
| owner_facet | DE-703 |
| physical | 39 Seiten Illustrationen |
| publishDate | 1985 |
| publishDateSearch | 1985 |
| publishDateSort | 1985 |
| publisher | Centrum voor Wiskunde en Informatica |
| record_format | marc |
| series | Report OS |
| series2 | Report OS |
| spelling | Orlin, James B. Verfasser (DE-588)170216128 aut Genuinely polynomial simplex and non-simplex algorithms for the minimum cost flow problem J.B. Orlin OS-R8504 Amsterdam Centrum voor Wiskunde en Informatica May 1985 39 Seiten Illustrationen txt rdacontent n rdamedia nc rdacarrier Report OS 1985,04 Report OS 1985,04 (DE-604)BV010205186 1985,04 |
| spellingShingle | Orlin, James B. Genuinely polynomial simplex and non-simplex algorithms for the minimum cost flow problem Report OS |
| title | Genuinely polynomial simplex and non-simplex algorithms for the minimum cost flow problem |
| title_alt | OS-R8504 |
| title_auth | Genuinely polynomial simplex and non-simplex algorithms for the minimum cost flow problem |
| title_exact_search | Genuinely polynomial simplex and non-simplex algorithms for the minimum cost flow problem |
| title_full | Genuinely polynomial simplex and non-simplex algorithms for the minimum cost flow problem J.B. Orlin |
| title_fullStr | Genuinely polynomial simplex and non-simplex algorithms for the minimum cost flow problem J.B. Orlin |
| title_full_unstemmed | Genuinely polynomial simplex and non-simplex algorithms for the minimum cost flow problem J.B. Orlin |
| title_short | Genuinely polynomial simplex and non-simplex algorithms for the minimum cost flow problem |
| title_sort | genuinely polynomial simplex and non simplex algorithms for the minimum cost flow problem |
| volume_link | (DE-604)BV010205186 |
| work_keys_str_mv | AT orlinjamesb genuinelypolynomialsimplexandnonsimplexalgorithmsfortheminimumcostflowproblem AT orlinjamesb osr8504 |