Ranking approach to max ordering combinatorial optimization and network flows:
Gespeichert in:
| Hauptverfasser: | , |
|---|---|
| Format: | Buch |
| Sprache: | English |
| Veröffentlicht: |
Kaiserslautern
Univ., Fachbereich Math.
1993
|
| Schriftenreihe: | Universität <Kaiserslautern> / Fachbereich Mathematik: Preprint
246 |
| Beschreibung: | 22 S. |
Internformat
MARC
| LEADER | 00000nam a2200000 cb4500 | ||
|---|---|---|---|
| 001 | BV009606978 | ||
| 003 | DE-604 | ||
| 005 | 19940526 | ||
| 007 | t| | ||
| 008 | 940520s1993 xx |||| 00||| engod | ||
| 035 | |a (OCoLC)75425012 | ||
| 035 | |a (DE-599)BVBBV009606978 | ||
| 040 | |a DE-604 |b ger |e rakddb | ||
| 041 | 0 | |a eng | |
| 049 | |a DE-12 |a DE-91G |a DE-634 | ||
| 100 | 1 | |a Hamacher, Horst W. |d 1951- |e Verfasser |0 (DE-588)109311698 |4 aut | |
| 245 | 1 | 0 | |a Ranking approach to max ordering combinatorial optimization and network flows |c Horst W. Hamacher and Claus Hüsselmann |
| 264 | 1 | |a Kaiserslautern |b Univ., Fachbereich Math. |c 1993 | |
| 300 | |a 22 S. | ||
| 336 | |b txt |2 rdacontent | ||
| 337 | |b n |2 rdamedia | ||
| 338 | |b nc |2 rdacarrier | ||
| 490 | 1 | |a Universität <Kaiserslautern> / Fachbereich Mathematik: Preprint |v 246 | |
| 700 | 1 | |a Hüsselmann, Claus |d 1966- |e Verfasser |0 (DE-588)124893961 |4 aut | |
| 810 | 2 | |a Fachbereich Mathematik: Preprint |t Universität <Kaiserslautern> |v 246 |w (DE-604)BV000003820 |9 246 | |
| 943 | 1 | |a oai:aleph.bib-bvb.de:BVB01-006349866 | |
Datensatz im Suchindex
| _version_ | 1817613068902858752 |
|---|---|
| adam_text | |
| any_adam_object | |
| author | Hamacher, Horst W. 1951- Hüsselmann, Claus 1966- |
| author_GND | (DE-588)109311698 (DE-588)124893961 |
| author_facet | Hamacher, Horst W. 1951- Hüsselmann, Claus 1966- |
| author_role | aut aut |
| author_sort | Hamacher, Horst W. 1951- |
| author_variant | h w h hw hwh c h ch |
| building | Verbundindex |
| bvnumber | BV009606978 |
| ctrlnum | (OCoLC)75425012 (DE-599)BVBBV009606978 |
| 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">BV009606978</controlfield><controlfield tag="003">DE-604</controlfield><controlfield tag="005">19940526</controlfield><controlfield tag="007">t|</controlfield><controlfield tag="008">940520s1993 xx |||| 00||| engod</controlfield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(OCoLC)75425012</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(DE-599)BVBBV009606978</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="0" ind2=" "><subfield code="a">eng</subfield></datafield><datafield tag="049" ind1=" " ind2=" "><subfield code="a">DE-12</subfield><subfield code="a">DE-91G</subfield><subfield code="a">DE-634</subfield></datafield><datafield tag="100" ind1="1" ind2=" "><subfield code="a">Hamacher, Horst W.</subfield><subfield code="d">1951-</subfield><subfield code="e">Verfasser</subfield><subfield code="0">(DE-588)109311698</subfield><subfield code="4">aut</subfield></datafield><datafield tag="245" ind1="1" ind2="0"><subfield code="a">Ranking approach to max ordering combinatorial optimization and network flows</subfield><subfield code="c">Horst W. Hamacher and Claus Hüsselmann</subfield></datafield><datafield tag="264" ind1=" " ind2="1"><subfield code="a">Kaiserslautern</subfield><subfield code="b">Univ., Fachbereich Math.</subfield><subfield code="c">1993</subfield></datafield><datafield tag="300" ind1=" " ind2=" "><subfield code="a">22 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">Universität <Kaiserslautern> / Fachbereich Mathematik: Preprint</subfield><subfield code="v">246</subfield></datafield><datafield tag="700" ind1="1" ind2=" "><subfield code="a">Hüsselmann, Claus</subfield><subfield code="d">1966-</subfield><subfield code="e">Verfasser</subfield><subfield code="0">(DE-588)124893961</subfield><subfield code="4">aut</subfield></datafield><datafield tag="810" ind1="2" ind2=" "><subfield code="a">Fachbereich Mathematik: Preprint</subfield><subfield code="t">Universität <Kaiserslautern></subfield><subfield code="v">246</subfield><subfield code="w">(DE-604)BV000003820</subfield><subfield code="9">246</subfield></datafield><datafield tag="943" ind1="1" ind2=" "><subfield code="a">oai:aleph.bib-bvb.de:BVB01-006349866</subfield></datafield></record></collection> |
| id | DE-604.BV009606978 |
| illustrated | Not Illustrated |
| indexdate | 2024-12-05T15:01:40Z |
| institution | BVB |
| language | English |
| oai_aleph_id | oai:aleph.bib-bvb.de:BVB01-006349866 |
| oclc_num | 75425012 |
| open_access_boolean | |
| owner | DE-12 DE-91G DE-BY-TUM DE-634 |
| owner_facet | DE-12 DE-91G DE-BY-TUM DE-634 |
| physical | 22 S. |
| publishDate | 1993 |
| publishDateSearch | 1993 |
| publishDateSort | 1993 |
| publisher | Univ., Fachbereich Math. |
| record_format | marc |
| series2 | Universität <Kaiserslautern> / Fachbereich Mathematik: Preprint |
| spelling | Hamacher, Horst W. 1951- Verfasser (DE-588)109311698 aut Ranking approach to max ordering combinatorial optimization and network flows Horst W. Hamacher and Claus Hüsselmann Kaiserslautern Univ., Fachbereich Math. 1993 22 S. txt rdacontent n rdamedia nc rdacarrier Universität <Kaiserslautern> / Fachbereich Mathematik: Preprint 246 Hüsselmann, Claus 1966- Verfasser (DE-588)124893961 aut Fachbereich Mathematik: Preprint Universität <Kaiserslautern> 246 (DE-604)BV000003820 246 |
| spellingShingle | Hamacher, Horst W. 1951- Hüsselmann, Claus 1966- Ranking approach to max ordering combinatorial optimization and network flows |
| title | Ranking approach to max ordering combinatorial optimization and network flows |
| title_auth | Ranking approach to max ordering combinatorial optimization and network flows |
| title_exact_search | Ranking approach to max ordering combinatorial optimization and network flows |
| title_full | Ranking approach to max ordering combinatorial optimization and network flows Horst W. Hamacher and Claus Hüsselmann |
| title_fullStr | Ranking approach to max ordering combinatorial optimization and network flows Horst W. Hamacher and Claus Hüsselmann |
| title_full_unstemmed | Ranking approach to max ordering combinatorial optimization and network flows Horst W. Hamacher and Claus Hüsselmann |
| title_short | Ranking approach to max ordering combinatorial optimization and network flows |
| title_sort | ranking approach to max ordering combinatorial optimization and network flows |
| volume_link | (DE-604)BV000003820 |
| work_keys_str_mv | AT hamacherhorstw rankingapproachtomaxorderingcombinatorialoptimizationandnetworkflows AT husselmannclaus rankingapproachtomaxorderingcombinatorialoptimizationandnetworkflows |