The shortest augmenting path method for solving assignment problems:
Gespeichert in:
| 1. Verfasser: | |
|---|---|
| Format: | Buch |
| Sprache: | Undetermined |
| Veröffentlicht: |
Bonn
1984
|
| Schriftenreihe: | Institut für Ökonometrie und Operations Research: Report
328 |
| Beschreibung: | 34 S. |
Internformat
MARC
| LEADER | 00000nam a2200000 cb4500 | ||
|---|---|---|---|
| 001 | BV000566582 | ||
| 003 | DE-604 | ||
| 005 | 00000000000000.0 | ||
| 007 | t | ||
| 008 | 870612s1984 |||| 00||| und d | ||
| 035 | |a (OCoLC)644273777 | ||
| 035 | |a (DE-599)BVBBV000566582 | ||
| 040 | |a DE-604 |b ger |e rakddb | ||
| 041 | |a und | ||
| 049 | |a DE-12 |a DE-703 | ||
| 084 | |a QH 400 |0 (DE-625)141571: |2 rvk | ||
| 100 | 1 | |a Derigs, Ulrich |e Verfasser |4 aut | |
| 245 | 1 | 0 | |a The shortest augmenting path method for solving assignment problems |
| 264 | 1 | |a Bonn |c 1984 | |
| 300 | |a 34 S. | ||
| 336 | |b txt |2 rdacontent | ||
| 337 | |b n |2 rdamedia | ||
| 338 | |b nc |2 rdacarrier | ||
| 490 | 1 | |a Institut für Ökonometrie und Operations Research: Report |v 328 | |
| 830 | 0 | |a Institut für Ökonometrie und Operations Research: Report |v 328 |w (DE-604)BV000010784 |9 328 | |
| 999 | |a oai:aleph.bib-bvb.de:BVB01-000349208 | ||
Datensatz im Suchindex
| _version_ | 1804115008770015232 |
|---|---|
| any_adam_object | |
| author | Derigs, Ulrich |
| author_facet | Derigs, Ulrich |
| author_role | aut |
| author_sort | Derigs, Ulrich |
| author_variant | u d ud |
| building | Verbundindex |
| bvnumber | BV000566582 |
| classification_rvk | QH 400 |
| ctrlnum | (OCoLC)644273777 (DE-599)BVBBV000566582 |
| discipline | Wirtschaftswissenschaften |
| format | Book |
| fullrecord | <?xml version="1.0" encoding="UTF-8"?><collection xmlns="http://www.loc.gov/MARC21/slim"><record><leader>00882nam a2200277 cb4500</leader><controlfield tag="001">BV000566582</controlfield><controlfield tag="003">DE-604</controlfield><controlfield tag="005">00000000000000.0</controlfield><controlfield tag="007">t</controlfield><controlfield tag="008">870612s1984 |||| 00||| und d</controlfield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(OCoLC)644273777</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(DE-599)BVBBV000566582</subfield></datafield><datafield tag="040" ind1=" " ind2=" "><subfield code="a">DE-604</subfield><subfield code="b">ger</subfield><subfield code="e">rakddb</subfield></datafield><datafield tag="041" ind1=" " ind2=" "><subfield code="a">und</subfield></datafield><datafield tag="049" ind1=" " ind2=" "><subfield code="a">DE-12</subfield><subfield code="a">DE-703</subfield></datafield><datafield tag="084" ind1=" " ind2=" "><subfield code="a">QH 400</subfield><subfield code="0">(DE-625)141571:</subfield><subfield code="2">rvk</subfield></datafield><datafield tag="100" ind1="1" ind2=" "><subfield code="a">Derigs, Ulrich</subfield><subfield code="e">Verfasser</subfield><subfield code="4">aut</subfield></datafield><datafield tag="245" ind1="1" ind2="0"><subfield code="a">The shortest augmenting path method for solving assignment problems</subfield></datafield><datafield tag="264" ind1=" " ind2="1"><subfield code="a">Bonn</subfield><subfield code="c">1984</subfield></datafield><datafield tag="300" ind1=" " ind2=" "><subfield code="a">34 S.</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">Institut für Ökonometrie und Operations Research: Report</subfield><subfield code="v">328</subfield></datafield><datafield tag="830" ind1=" " ind2="0"><subfield code="a">Institut für Ökonometrie und Operations Research: Report</subfield><subfield code="v">328</subfield><subfield code="w">(DE-604)BV000010784</subfield><subfield code="9">328</subfield></datafield><datafield tag="999" ind1=" " ind2=" "><subfield code="a">oai:aleph.bib-bvb.de:BVB01-000349208</subfield></datafield></record></collection> |
| id | DE-604.BV000566582 |
| illustrated | Not Illustrated |
| indexdate | 2024-07-09T15:15:47Z |
| institution | BVB |
| language | Undetermined |
| oai_aleph_id | oai:aleph.bib-bvb.de:BVB01-000349208 |
| oclc_num | 644273777 |
| open_access_boolean | |
| owner | DE-12 DE-703 |
| owner_facet | DE-12 DE-703 |
| physical | 34 S. |
| publishDate | 1984 |
| publishDateSearch | 1984 |
| publishDateSort | 1984 |
| record_format | marc |
| series | Institut für Ökonometrie und Operations Research: Report |
| series2 | Institut für Ökonometrie und Operations Research: Report |
| spelling | Derigs, Ulrich Verfasser aut The shortest augmenting path method for solving assignment problems Bonn 1984 34 S. txt rdacontent n rdamedia nc rdacarrier Institut für Ökonometrie und Operations Research: Report 328 Institut für Ökonometrie und Operations Research: Report 328 (DE-604)BV000010784 328 |
| spellingShingle | Derigs, Ulrich The shortest augmenting path method for solving assignment problems Institut für Ökonometrie und Operations Research: Report |
| title | The shortest augmenting path method for solving assignment problems |
| title_auth | The shortest augmenting path method for solving assignment problems |
| title_exact_search | The shortest augmenting path method for solving assignment problems |
| title_full | The shortest augmenting path method for solving assignment problems |
| title_fullStr | The shortest augmenting path method for solving assignment problems |
| title_full_unstemmed | The shortest augmenting path method for solving assignment problems |
| title_short | The shortest augmenting path method for solving assignment problems |
| title_sort | the shortest augmenting path method for solving assignment problems |
| volume_link | (DE-604)BV000010784 |
| work_keys_str_mv | AT derigsulrich theshortestaugmentingpathmethodforsolvingassignmentproblems |