Optimization algorithms for networks and graphs:
Gespeichert in:
| Hauptverfasser: | , |
|---|---|
| Format: | Buch |
| Sprache: | English |
| Veröffentlicht: |
New York u.a.
Dekker
1992
|
| Ausgabe: | 2. ed., rev. and expanded |
| Schlagworte: | |
| Beschreibung: | X, 470 S. zahlr. graph. Darst. 1 Diskette, 5,25 ̋ |
| ISBN: | 0824786025 |
Internformat
MARC
| LEADER | 00000nam a2200000 c 4500 | ||
|---|---|---|---|
| 001 | BV006607118 | ||
| 003 | DE-604 | ||
| 005 | 20150619 | ||
| 007 | t | ||
| 008 | 930210s1992 d||| |||| 00||| eng d | ||
| 020 | |a 0824786025 |9 0-8247-8602-5 | ||
| 035 | |a (OCoLC)25202967 | ||
| 035 | |a (DE-599)BVBBV006607118 | ||
| 040 | |a DE-604 |b ger |e rakwb | ||
| 041 | 0 | |a eng | |
| 049 | |a DE-739 |a DE-91G |a DE-384 |a DE-N2 |a DE-83 |a DE-11 |a DE-188 | ||
| 050 | 0 | |a QA166 | |
| 082 | 0 | |a 658.4/032 |2 20 | |
| 084 | |a QH 450 |0 (DE-625)141593: |2 rvk | ||
| 084 | |a SK 890 |0 (DE-625)143267: |2 rvk | ||
| 084 | |a SK 970 |0 (DE-625)143276: |2 rvk | ||
| 084 | |a MAT 055f |2 stub | ||
| 084 | |a MAT 913f |2 stub | ||
| 100 | 1 | |a Evans, James R. |d 1950- |e Verfasser |0 (DE-588)170321924 |4 aut | |
| 245 | 1 | 0 | |a Optimization algorithms for networks and graphs |c James R. Evans ; Edward Minieka |
| 250 | |a 2. ed., rev. and expanded | ||
| 264 | 1 | |a New York u.a. |b Dekker |c 1992 | |
| 300 | |a X, 470 S. |b zahlr. graph. Darst. |e 1 Diskette, 5,25 ̋ | ||
| 336 | |b txt |2 rdacontent | ||
| 337 | |b n |2 rdamedia | ||
| 338 | |b nc |2 rdacarrier | ||
| 650 | 4 | |a Algorithmes | |
| 650 | 7 | |a Algoritmen |2 gtt | |
| 650 | 4 | |a Analyse de réseau (Planification) | |
| 650 | 7 | |a Grafen |2 gtt | |
| 650 | 4 | |a Graphes, Théorie des | |
| 650 | 7 | |a Netwerken |2 gtt | |
| 650 | 7 | |a Optimaliseren |2 gtt | |
| 650 | 4 | |a Algorithms | |
| 650 | 4 | |a Graph theory | |
| 650 | 4 | |a Network analysis (Planning) | |
| 650 | 0 | 7 | |a Graphentheorie |0 (DE-588)4113782-6 |2 gnd |9 rswk-swf |
| 650 | 0 | 7 | |a Kürzester-Weg-Problem |0 (DE-588)4138403-9 |2 gnd |9 rswk-swf |
| 650 | 0 | 7 | |a Graph |0 (DE-588)4021842-9 |2 gnd |9 rswk-swf |
| 650 | 0 | 7 | |a Netzwerk |0 (DE-588)4171529-9 |2 gnd |9 rswk-swf |
| 650 | 0 | 7 | |a Optimierung |0 (DE-588)4043664-0 |2 gnd |9 rswk-swf |
| 650 | 0 | 7 | |a Netzwerkanalyse |0 (DE-588)4075298-7 |2 gnd |9 rswk-swf |
| 650 | 0 | 7 | |a Algorithmus |0 (DE-588)4001183-5 |2 gnd |9 rswk-swf |
| 650 | 0 | 7 | |a Netz |0 (DE-588)4317151-5 |2 gnd |9 rswk-swf |
| 650 | 0 | 7 | |a Diskette |0 (DE-588)4122115-1 |2 gnd |9 rswk-swf |
| 650 | 0 | 7 | |a Netzplantechnik |0 (DE-588)4075297-5 |2 gnd |9 rswk-swf |
| 689 | 0 | 0 | |a Algorithmus |0 (DE-588)4001183-5 |D s |
| 689 | 0 | 1 | |a Optimierung |0 (DE-588)4043664-0 |D s |
| 689 | 0 | 2 | |a Netz |0 (DE-588)4317151-5 |D s |
| 689 | 0 | 3 | |a Diskette |0 (DE-588)4122115-1 |D s |
| 689 | 0 | |5 DE-604 | |
| 689 | 1 | 0 | |a Algorithmus |0 (DE-588)4001183-5 |D s |
| 689 | 1 | 1 | |a Optimierung |0 (DE-588)4043664-0 |D s |
| 689 | 1 | 2 | |a Graph |0 (DE-588)4021842-9 |D s |
| 689 | 1 | 3 | |a Diskette |0 (DE-588)4122115-1 |D s |
| 689 | 1 | |5 DE-604 | |
| 689 | 2 | 0 | |a Netzplantechnik |0 (DE-588)4075297-5 |D s |
| 689 | 2 | 1 | |a Graphentheorie |0 (DE-588)4113782-6 |D s |
| 689 | 2 | |8 1\p |5 DE-604 | |
| 689 | 3 | 0 | |a Graphentheorie |0 (DE-588)4113782-6 |D s |
| 689 | 3 | 1 | |a Optimierung |0 (DE-588)4043664-0 |D s |
| 689 | 3 | |8 2\p |5 DE-604 | |
| 689 | 4 | 0 | |a Netzwerkanalyse |0 (DE-588)4075298-7 |D s |
| 689 | 4 | 1 | |a Graphentheorie |0 (DE-588)4113782-6 |D s |
| 689 | 4 | |8 3\p |5 DE-604 | |
| 689 | 5 | 0 | |a Netzwerk |0 (DE-588)4171529-9 |D s |
| 689 | 5 | |8 4\p |5 DE-604 | |
| 689 | 6 | 0 | |a Kürzester-Weg-Problem |0 (DE-588)4138403-9 |D s |
| 689 | 6 | |8 5\p |5 DE-604 | |
| 700 | 1 | |a Minieka, Edward |e Verfasser |4 aut | |
| 999 | |a oai:aleph.bib-bvb.de:BVB01-004220742 | ||
| 883 | 1 | |8 1\p |a cgwrk |d 20201028 |q DE-101 |u https://d-nb.info/provenance/plan#cgwrk | |
| 883 | 1 | |8 2\p |a cgwrk |d 20201028 |q DE-101 |u https://d-nb.info/provenance/plan#cgwrk | |
| 883 | 1 | |8 3\p |a cgwrk |d 20201028 |q DE-101 |u https://d-nb.info/provenance/plan#cgwrk | |
| 883 | 1 | |8 4\p |a cgwrk |d 20201028 |q DE-101 |u https://d-nb.info/provenance/plan#cgwrk | |
| 883 | 1 | |8 5\p |a cgwrk |d 20201028 |q DE-101 |u https://d-nb.info/provenance/plan#cgwrk | |
Datensatz im Suchindex
| _version_ | 1804120882043420672 |
|---|---|
| any_adam_object | |
| author | Evans, James R. 1950- Minieka, Edward |
| author_GND | (DE-588)170321924 |
| author_facet | Evans, James R. 1950- Minieka, Edward |
| author_role | aut aut |
| author_sort | Evans, James R. 1950- |
| author_variant | j r e jr jre e m em |
| building | Verbundindex |
| bvnumber | BV006607118 |
| callnumber-first | Q - Science |
| callnumber-label | QA166 |
| callnumber-raw | QA166 |
| callnumber-search | QA166 |
| callnumber-sort | QA 3166 |
| callnumber-subject | QA - Mathematics |
| classification_rvk | QH 450 SK 890 SK 970 |
| classification_tum | MAT 055f MAT 913f |
| ctrlnum | (OCoLC)25202967 (DE-599)BVBBV006607118 |
| dewey-full | 658.4/032 |
| dewey-hundreds | 600 - Technology (Applied sciences) |
| dewey-ones | 658 - General management |
| dewey-raw | 658.4/032 |
| dewey-search | 658.4/032 |
| dewey-sort | 3658.4 232 |
| dewey-tens | 650 - Management and auxiliary services |
| discipline | Mathematik Wirtschaftswissenschaften |
| edition | 2. ed., rev. and expanded |
| format | Book |
| fullrecord | <?xml version="1.0" encoding="UTF-8"?><collection xmlns="http://www.loc.gov/MARC21/slim"><record><leader>03556nam a2200937 c 4500</leader><controlfield tag="001">BV006607118</controlfield><controlfield tag="003">DE-604</controlfield><controlfield tag="005">20150619 </controlfield><controlfield tag="007">t</controlfield><controlfield tag="008">930210s1992 d||| |||| 00||| eng d</controlfield><datafield tag="020" ind1=" " ind2=" "><subfield code="a">0824786025</subfield><subfield code="9">0-8247-8602-5</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(OCoLC)25202967</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(DE-599)BVBBV006607118</subfield></datafield><datafield tag="040" ind1=" " ind2=" "><subfield code="a">DE-604</subfield><subfield code="b">ger</subfield><subfield code="e">rakwb</subfield></datafield><datafield tag="041" ind1="0" ind2=" "><subfield code="a">eng</subfield></datafield><datafield tag="049" ind1=" " ind2=" "><subfield code="a">DE-739</subfield><subfield code="a">DE-91G</subfield><subfield code="a">DE-384</subfield><subfield code="a">DE-N2</subfield><subfield code="a">DE-83</subfield><subfield code="a">DE-11</subfield><subfield code="a">DE-188</subfield></datafield><datafield tag="050" ind1=" " ind2="0"><subfield code="a">QA166</subfield></datafield><datafield tag="082" ind1="0" ind2=" "><subfield code="a">658.4/032</subfield><subfield code="2">20</subfield></datafield><datafield tag="084" ind1=" " ind2=" "><subfield code="a">QH 450</subfield><subfield code="0">(DE-625)141593:</subfield><subfield code="2">rvk</subfield></datafield><datafield tag="084" ind1=" " ind2=" "><subfield code="a">SK 890</subfield><subfield code="0">(DE-625)143267:</subfield><subfield code="2">rvk</subfield></datafield><datafield tag="084" ind1=" " ind2=" "><subfield code="a">SK 970</subfield><subfield code="0">(DE-625)143276:</subfield><subfield code="2">rvk</subfield></datafield><datafield tag="084" ind1=" " ind2=" "><subfield code="a">MAT 055f</subfield><subfield code="2">stub</subfield></datafield><datafield tag="084" ind1=" " ind2=" "><subfield code="a">MAT 913f</subfield><subfield code="2">stub</subfield></datafield><datafield tag="100" ind1="1" ind2=" "><subfield code="a">Evans, James R.</subfield><subfield code="d">1950-</subfield><subfield code="e">Verfasser</subfield><subfield code="0">(DE-588)170321924</subfield><subfield code="4">aut</subfield></datafield><datafield tag="245" ind1="1" ind2="0"><subfield code="a">Optimization algorithms for networks and graphs</subfield><subfield code="c">James R. Evans ; Edward Minieka</subfield></datafield><datafield tag="250" ind1=" " ind2=" "><subfield code="a">2. ed., rev. and expanded</subfield></datafield><datafield tag="264" ind1=" " ind2="1"><subfield code="a">New York u.a.</subfield><subfield code="b">Dekker</subfield><subfield code="c">1992</subfield></datafield><datafield tag="300" ind1=" " ind2=" "><subfield code="a">X, 470 S.</subfield><subfield code="b">zahlr. graph. Darst.</subfield><subfield code="e">1 Diskette, 5,25 ̋</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="650" ind1=" " ind2="4"><subfield code="a">Algorithmes</subfield></datafield><datafield tag="650" ind1=" " ind2="7"><subfield code="a">Algoritmen</subfield><subfield code="2">gtt</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Analyse de réseau (Planification)</subfield></datafield><datafield tag="650" ind1=" " ind2="7"><subfield code="a">Grafen</subfield><subfield code="2">gtt</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Graphes, Théorie des</subfield></datafield><datafield tag="650" ind1=" " ind2="7"><subfield code="a">Netwerken</subfield><subfield code="2">gtt</subfield></datafield><datafield tag="650" ind1=" " ind2="7"><subfield code="a">Optimaliseren</subfield><subfield code="2">gtt</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Algorithms</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Graph theory</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Network analysis (Planning)</subfield></datafield><datafield tag="650" ind1="0" ind2="7"><subfield code="a">Graphentheorie</subfield><subfield code="0">(DE-588)4113782-6</subfield><subfield code="2">gnd</subfield><subfield code="9">rswk-swf</subfield></datafield><datafield tag="650" ind1="0" ind2="7"><subfield code="a">Kürzester-Weg-Problem</subfield><subfield code="0">(DE-588)4138403-9</subfield><subfield code="2">gnd</subfield><subfield code="9">rswk-swf</subfield></datafield><datafield tag="650" ind1="0" ind2="7"><subfield code="a">Graph</subfield><subfield code="0">(DE-588)4021842-9</subfield><subfield code="2">gnd</subfield><subfield code="9">rswk-swf</subfield></datafield><datafield tag="650" ind1="0" ind2="7"><subfield code="a">Netzwerk</subfield><subfield code="0">(DE-588)4171529-9</subfield><subfield code="2">gnd</subfield><subfield code="9">rswk-swf</subfield></datafield><datafield tag="650" ind1="0" ind2="7"><subfield code="a">Optimierung</subfield><subfield code="0">(DE-588)4043664-0</subfield><subfield code="2">gnd</subfield><subfield code="9">rswk-swf</subfield></datafield><datafield tag="650" ind1="0" ind2="7"><subfield code="a">Netzwerkanalyse</subfield><subfield code="0">(DE-588)4075298-7</subfield><subfield code="2">gnd</subfield><subfield code="9">rswk-swf</subfield></datafield><datafield tag="650" ind1="0" ind2="7"><subfield code="a">Algorithmus</subfield><subfield code="0">(DE-588)4001183-5</subfield><subfield code="2">gnd</subfield><subfield code="9">rswk-swf</subfield></datafield><datafield tag="650" ind1="0" ind2="7"><subfield code="a">Netz</subfield><subfield code="0">(DE-588)4317151-5</subfield><subfield code="2">gnd</subfield><subfield code="9">rswk-swf</subfield></datafield><datafield tag="650" ind1="0" ind2="7"><subfield code="a">Diskette</subfield><subfield code="0">(DE-588)4122115-1</subfield><subfield code="2">gnd</subfield><subfield code="9">rswk-swf</subfield></datafield><datafield tag="650" ind1="0" ind2="7"><subfield code="a">Netzplantechnik</subfield><subfield code="0">(DE-588)4075297-5</subfield><subfield code="2">gnd</subfield><subfield code="9">rswk-swf</subfield></datafield><datafield tag="689" ind1="0" ind2="0"><subfield code="a">Algorithmus</subfield><subfield code="0">(DE-588)4001183-5</subfield><subfield code="D">s</subfield></datafield><datafield tag="689" ind1="0" ind2="1"><subfield code="a">Optimierung</subfield><subfield code="0">(DE-588)4043664-0</subfield><subfield code="D">s</subfield></datafield><datafield tag="689" ind1="0" ind2="2"><subfield code="a">Netz</subfield><subfield code="0">(DE-588)4317151-5</subfield><subfield code="D">s</subfield></datafield><datafield tag="689" ind1="0" ind2="3"><subfield code="a">Diskette</subfield><subfield code="0">(DE-588)4122115-1</subfield><subfield code="D">s</subfield></datafield><datafield tag="689" ind1="0" ind2=" "><subfield code="5">DE-604</subfield></datafield><datafield tag="689" ind1="1" ind2="0"><subfield code="a">Algorithmus</subfield><subfield code="0">(DE-588)4001183-5</subfield><subfield code="D">s</subfield></datafield><datafield tag="689" ind1="1" ind2="1"><subfield code="a">Optimierung</subfield><subfield code="0">(DE-588)4043664-0</subfield><subfield code="D">s</subfield></datafield><datafield tag="689" ind1="1" ind2="2"><subfield code="a">Graph</subfield><subfield code="0">(DE-588)4021842-9</subfield><subfield code="D">s</subfield></datafield><datafield tag="689" ind1="1" ind2="3"><subfield code="a">Diskette</subfield><subfield code="0">(DE-588)4122115-1</subfield><subfield code="D">s</subfield></datafield><datafield tag="689" ind1="1" ind2=" "><subfield code="5">DE-604</subfield></datafield><datafield tag="689" ind1="2" ind2="0"><subfield code="a">Netzplantechnik</subfield><subfield code="0">(DE-588)4075297-5</subfield><subfield code="D">s</subfield></datafield><datafield tag="689" ind1="2" ind2="1"><subfield code="a">Graphentheorie</subfield><subfield code="0">(DE-588)4113782-6</subfield><subfield code="D">s</subfield></datafield><datafield tag="689" ind1="2" ind2=" "><subfield code="8">1\p</subfield><subfield code="5">DE-604</subfield></datafield><datafield tag="689" ind1="3" ind2="0"><subfield code="a">Graphentheorie</subfield><subfield code="0">(DE-588)4113782-6</subfield><subfield code="D">s</subfield></datafield><datafield tag="689" ind1="3" ind2="1"><subfield code="a">Optimierung</subfield><subfield code="0">(DE-588)4043664-0</subfield><subfield code="D">s</subfield></datafield><datafield tag="689" ind1="3" ind2=" "><subfield code="8">2\p</subfield><subfield code="5">DE-604</subfield></datafield><datafield tag="689" ind1="4" ind2="0"><subfield code="a">Netzwerkanalyse</subfield><subfield code="0">(DE-588)4075298-7</subfield><subfield code="D">s</subfield></datafield><datafield tag="689" ind1="4" ind2="1"><subfield code="a">Graphentheorie</subfield><subfield code="0">(DE-588)4113782-6</subfield><subfield code="D">s</subfield></datafield><datafield tag="689" ind1="4" ind2=" "><subfield code="8">3\p</subfield><subfield code="5">DE-604</subfield></datafield><datafield tag="689" ind1="5" ind2="0"><subfield code="a">Netzwerk</subfield><subfield code="0">(DE-588)4171529-9</subfield><subfield code="D">s</subfield></datafield><datafield tag="689" ind1="5" ind2=" "><subfield code="8">4\p</subfield><subfield code="5">DE-604</subfield></datafield><datafield tag="689" ind1="6" ind2="0"><subfield code="a">Kürzester-Weg-Problem</subfield><subfield code="0">(DE-588)4138403-9</subfield><subfield code="D">s</subfield></datafield><datafield tag="689" ind1="6" ind2=" "><subfield code="8">5\p</subfield><subfield code="5">DE-604</subfield></datafield><datafield tag="700" ind1="1" ind2=" "><subfield code="a">Minieka, Edward</subfield><subfield code="e">Verfasser</subfield><subfield code="4">aut</subfield></datafield><datafield tag="999" ind1=" " ind2=" "><subfield code="a">oai:aleph.bib-bvb.de:BVB01-004220742</subfield></datafield><datafield tag="883" ind1="1" ind2=" "><subfield code="8">1\p</subfield><subfield code="a">cgwrk</subfield><subfield code="d">20201028</subfield><subfield code="q">DE-101</subfield><subfield code="u">https://d-nb.info/provenance/plan#cgwrk</subfield></datafield><datafield tag="883" ind1="1" ind2=" "><subfield code="8">2\p</subfield><subfield code="a">cgwrk</subfield><subfield code="d">20201028</subfield><subfield code="q">DE-101</subfield><subfield code="u">https://d-nb.info/provenance/plan#cgwrk</subfield></datafield><datafield tag="883" ind1="1" ind2=" "><subfield code="8">3\p</subfield><subfield code="a">cgwrk</subfield><subfield code="d">20201028</subfield><subfield code="q">DE-101</subfield><subfield code="u">https://d-nb.info/provenance/plan#cgwrk</subfield></datafield><datafield tag="883" ind1="1" ind2=" "><subfield code="8">4\p</subfield><subfield code="a">cgwrk</subfield><subfield code="d">20201028</subfield><subfield code="q">DE-101</subfield><subfield code="u">https://d-nb.info/provenance/plan#cgwrk</subfield></datafield><datafield tag="883" ind1="1" ind2=" "><subfield code="8">5\p</subfield><subfield code="a">cgwrk</subfield><subfield code="d">20201028</subfield><subfield code="q">DE-101</subfield><subfield code="u">https://d-nb.info/provenance/plan#cgwrk</subfield></datafield></record></collection> |
| id | DE-604.BV006607118 |
| illustrated | Illustrated |
| indexdate | 2024-07-09T16:49:08Z |
| institution | BVB |
| isbn | 0824786025 |
| language | English |
| oai_aleph_id | oai:aleph.bib-bvb.de:BVB01-004220742 |
| oclc_num | 25202967 |
| open_access_boolean | |
| owner | DE-739 DE-91G DE-BY-TUM DE-384 DE-N2 DE-83 DE-11 DE-188 |
| owner_facet | DE-739 DE-91G DE-BY-TUM DE-384 DE-N2 DE-83 DE-11 DE-188 |
| physical | X, 470 S. zahlr. graph. Darst. 1 Diskette, 5,25 ̋ |
| publishDate | 1992 |
| publishDateSearch | 1992 |
| publishDateSort | 1992 |
| publisher | Dekker |
| record_format | marc |
| spelling | Evans, James R. 1950- Verfasser (DE-588)170321924 aut Optimization algorithms for networks and graphs James R. Evans ; Edward Minieka 2. ed., rev. and expanded New York u.a. Dekker 1992 X, 470 S. zahlr. graph. Darst. 1 Diskette, 5,25 ̋ txt rdacontent n rdamedia nc rdacarrier Algorithmes Algoritmen gtt Analyse de réseau (Planification) Grafen gtt Graphes, Théorie des Netwerken gtt Optimaliseren gtt Algorithms Graph theory Network analysis (Planning) Graphentheorie (DE-588)4113782-6 gnd rswk-swf Kürzester-Weg-Problem (DE-588)4138403-9 gnd rswk-swf Graph (DE-588)4021842-9 gnd rswk-swf Netzwerk (DE-588)4171529-9 gnd rswk-swf Optimierung (DE-588)4043664-0 gnd rswk-swf Netzwerkanalyse (DE-588)4075298-7 gnd rswk-swf Algorithmus (DE-588)4001183-5 gnd rswk-swf Netz (DE-588)4317151-5 gnd rswk-swf Diskette (DE-588)4122115-1 gnd rswk-swf Netzplantechnik (DE-588)4075297-5 gnd rswk-swf Algorithmus (DE-588)4001183-5 s Optimierung (DE-588)4043664-0 s Netz (DE-588)4317151-5 s Diskette (DE-588)4122115-1 s DE-604 Graph (DE-588)4021842-9 s Netzplantechnik (DE-588)4075297-5 s Graphentheorie (DE-588)4113782-6 s 1\p DE-604 2\p DE-604 Netzwerkanalyse (DE-588)4075298-7 s 3\p DE-604 Netzwerk (DE-588)4171529-9 s 4\p DE-604 Kürzester-Weg-Problem (DE-588)4138403-9 s 5\p DE-604 Minieka, Edward Verfasser aut 1\p cgwrk 20201028 DE-101 https://d-nb.info/provenance/plan#cgwrk 2\p cgwrk 20201028 DE-101 https://d-nb.info/provenance/plan#cgwrk 3\p cgwrk 20201028 DE-101 https://d-nb.info/provenance/plan#cgwrk 4\p cgwrk 20201028 DE-101 https://d-nb.info/provenance/plan#cgwrk 5\p cgwrk 20201028 DE-101 https://d-nb.info/provenance/plan#cgwrk |
| spellingShingle | Evans, James R. 1950- Minieka, Edward Optimization algorithms for networks and graphs Algorithmes Algoritmen gtt Analyse de réseau (Planification) Grafen gtt Graphes, Théorie des Netwerken gtt Optimaliseren gtt Algorithms Graph theory Network analysis (Planning) Graphentheorie (DE-588)4113782-6 gnd Kürzester-Weg-Problem (DE-588)4138403-9 gnd Graph (DE-588)4021842-9 gnd Netzwerk (DE-588)4171529-9 gnd Optimierung (DE-588)4043664-0 gnd Netzwerkanalyse (DE-588)4075298-7 gnd Algorithmus (DE-588)4001183-5 gnd Netz (DE-588)4317151-5 gnd Diskette (DE-588)4122115-1 gnd Netzplantechnik (DE-588)4075297-5 gnd |
| subject_GND | (DE-588)4113782-6 (DE-588)4138403-9 (DE-588)4021842-9 (DE-588)4171529-9 (DE-588)4043664-0 (DE-588)4075298-7 (DE-588)4001183-5 (DE-588)4317151-5 (DE-588)4122115-1 (DE-588)4075297-5 |
| title | Optimization algorithms for networks and graphs |
| title_auth | Optimization algorithms for networks and graphs |
| title_exact_search | Optimization algorithms for networks and graphs |
| title_full | Optimization algorithms for networks and graphs James R. Evans ; Edward Minieka |
| title_fullStr | Optimization algorithms for networks and graphs James R. Evans ; Edward Minieka |
| title_full_unstemmed | Optimization algorithms for networks and graphs James R. Evans ; Edward Minieka |
| title_short | Optimization algorithms for networks and graphs |
| title_sort | optimization algorithms for networks and graphs |
| topic | Algorithmes Algoritmen gtt Analyse de réseau (Planification) Grafen gtt Graphes, Théorie des Netwerken gtt Optimaliseren gtt Algorithms Graph theory Network analysis (Planning) Graphentheorie (DE-588)4113782-6 gnd Kürzester-Weg-Problem (DE-588)4138403-9 gnd Graph (DE-588)4021842-9 gnd Netzwerk (DE-588)4171529-9 gnd Optimierung (DE-588)4043664-0 gnd Netzwerkanalyse (DE-588)4075298-7 gnd Algorithmus (DE-588)4001183-5 gnd Netz (DE-588)4317151-5 gnd Diskette (DE-588)4122115-1 gnd Netzplantechnik (DE-588)4075297-5 gnd |
| topic_facet | Algorithmes Algoritmen Analyse de réseau (Planification) Grafen Graphes, Théorie des Netwerken Optimaliseren Algorithms Graph theory Network analysis (Planning) Graphentheorie Kürzester-Weg-Problem Graph Netzwerk Optimierung Netzwerkanalyse Algorithmus Netz Diskette Netzplantechnik |
| work_keys_str_mv | AT evansjamesr optimizationalgorithmsfornetworksandgraphs AT miniekaedward optimizationalgorithmsfornetworksandgraphs |