Networks and graphs: techniques and computational methods
Gespeichert in:
| 1. Verfasser: | |
|---|---|
| Format: | Elektronisch E-Book |
| Sprache: | English |
| Veröffentlicht: |
Chichester
Horwood Pub.
[2003]
|
| Schlagworte: | |
| Online-Zugang: | Volltext |
| Beschreibung: | Includes bibliographical references (pages 187-188) and index Dr Smith here presents essential mathematical and computational ideas of network optimisation for senior undergraduate and postgraduate students in mathematics, computer science and operational research. He shows how algorithms can be used for finding optimal paths and flows, identifying trees in networks, and optimal matching. Later chapters discuss postman and salesperson tours, and demonstrate how many network problems are related to the ''minimal-cost feasible-flow'' problem. Techniques are presented both informally and with mathematical rigour and aspects of computation, especially of complexity, have been included. Numerous examples and diagrams illustrate the techniques and applications. The book also includes problem exercises with tutorial hints. Presents essential mathematical and computational ideas of network optimisation for senior undergraduate and postgraduate students in mathematics, computer science and operational researchDemonstrates how algorithms can be used for finding optimal paths and flows, identifying trees in networks and optimal matchingNumerous examples and diagrams illustrate the techniques and applications |
| Beschreibung: | 1 Online-Ressource (x, 193 pages) |
| ISBN: | 9780857099570 0857099574 1898563918 9781898563914 |
Internformat
MARC
| LEADER | 00000nmm a2200000zc 4500 | ||
|---|---|---|---|
| 001 | BV042317202 | ||
| 003 | DE-604 | ||
| 005 | 00000000000000.0 | ||
| 007 | cr|uuu---uuuuu | ||
| 008 | 150129s2003 |||| o||u| ||||||eng d | ||
| 020 | |a 9780857099570 |c electronic bk. |9 978-0-85709-957-0 | ||
| 020 | |a 0857099574 |c electronic bk. |9 0-85709-957-4 | ||
| 020 | |a 1898563918 |9 1-898563-91-8 | ||
| 020 | |a 9781898563914 |9 978-1-898563-91-4 | ||
| 035 | |a (OCoLC)869282256 | ||
| 035 | |a (DE-599)BVBBV042317202 | ||
| 040 | |a DE-604 |b ger |e aacr | ||
| 041 | 0 | |a eng | |
| 049 | |a DE-1046 | ||
| 082 | 0 | |a 511/.5 |2 22 | |
| 100 | 1 | |a Smith, David K., (David Kendall) |e Verfasser |4 aut | |
| 245 | 1 | 0 | |a Networks and graphs |b techniques and computational methods |c David K. Smith |
| 264 | 1 | |a Chichester |b Horwood Pub. |c [2003] | |
| 300 | |a 1 Online-Ressource (x, 193 pages) | ||
| 336 | |b txt |2 rdacontent | ||
| 337 | |b c |2 rdamedia | ||
| 338 | |b cr |2 rdacarrier | ||
| 500 | |a Includes bibliographical references (pages 187-188) and index | ||
| 500 | |a Dr Smith here presents essential mathematical and computational ideas of network optimisation for senior undergraduate and postgraduate students in mathematics, computer science and operational research. He shows how algorithms can be used for finding optimal paths and flows, identifying trees in networks, and optimal matching. Later chapters discuss postman and salesperson tours, and demonstrate how many network problems are related to the ''minimal-cost feasible-flow'' problem. Techniques are presented both informally and with mathematical rigour and aspects of computation, especially of complexity, have been included. Numerous examples and diagrams illustrate the techniques and applications. The book also includes problem exercises with tutorial hints. Presents essential mathematical and computational ideas of network optimisation for senior undergraduate and postgraduate students in mathematics, computer science and operational researchDemonstrates how algorithms can be used for finding optimal paths and flows, identifying trees in networks and optimal matchingNumerous examples and diagrams illustrate the techniques and applications | ||
| 650 | 7 | |a MATHEMATICS / General |2 bisacsh | |
| 650 | 4 | |a Datenverarbeitung | |
| 650 | 4 | |a Graph theory |x Data processing | |
| 650 | 4 | |a Network analysis (Planning) | |
| 650 | 4 | |a Mathemtaical optimization | |
| 856 | 4 | 0 | |u http://www.sciencedirect.com/science/book/9781898563914 |x Verlag |3 Volltext |
| 912 | |a ZDB-33-ESD |a ZDB-33-EBS | ||
| 940 | 1 | |q FAW_PDA_ESD | |
| 940 | 1 | |q FLA_PDA_ESD | |
| 999 | |a oai:aleph.bib-bvb.de:BVB01-027754193 | ||
Datensatz im Suchindex
| _version_ | 1804152913385226240 |
|---|---|
| any_adam_object | |
| author | Smith, David K., (David Kendall) |
| author_facet | Smith, David K., (David Kendall) |
| author_role | aut |
| author_sort | Smith, David K., (David Kendall) |
| author_variant | d k d k s dkdk dkdks |
| building | Verbundindex |
| bvnumber | BV042317202 |
| collection | ZDB-33-ESD ZDB-33-EBS |
| ctrlnum | (OCoLC)869282256 (DE-599)BVBBV042317202 |
| dewey-full | 511/.5 |
| dewey-hundreds | 500 - Natural sciences and mathematics |
| dewey-ones | 511 - General principles of mathematics |
| dewey-raw | 511/.5 |
| dewey-search | 511/.5 |
| dewey-sort | 3511 15 |
| dewey-tens | 510 - Mathematics |
| discipline | Mathematik |
| format | Electronic eBook |
| fullrecord | <?xml version="1.0" encoding="UTF-8"?><collection xmlns="http://www.loc.gov/MARC21/slim"><record><leader>02614nmm a2200433zc 4500</leader><controlfield tag="001">BV042317202</controlfield><controlfield tag="003">DE-604</controlfield><controlfield tag="005">00000000000000.0</controlfield><controlfield tag="007">cr|uuu---uuuuu</controlfield><controlfield tag="008">150129s2003 |||| o||u| ||||||eng d</controlfield><datafield tag="020" ind1=" " ind2=" "><subfield code="a">9780857099570</subfield><subfield code="c">electronic bk.</subfield><subfield code="9">978-0-85709-957-0</subfield></datafield><datafield tag="020" ind1=" " ind2=" "><subfield code="a">0857099574</subfield><subfield code="c">electronic bk.</subfield><subfield code="9">0-85709-957-4</subfield></datafield><datafield tag="020" ind1=" " ind2=" "><subfield code="a">1898563918</subfield><subfield code="9">1-898563-91-8</subfield></datafield><datafield tag="020" ind1=" " ind2=" "><subfield code="a">9781898563914</subfield><subfield code="9">978-1-898563-91-4</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(OCoLC)869282256</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(DE-599)BVBBV042317202</subfield></datafield><datafield tag="040" ind1=" " ind2=" "><subfield code="a">DE-604</subfield><subfield code="b">ger</subfield><subfield code="e">aacr</subfield></datafield><datafield tag="041" ind1="0" ind2=" "><subfield code="a">eng</subfield></datafield><datafield tag="049" ind1=" " ind2=" "><subfield code="a">DE-1046</subfield></datafield><datafield tag="082" ind1="0" ind2=" "><subfield code="a">511/.5</subfield><subfield code="2">22</subfield></datafield><datafield tag="100" ind1="1" ind2=" "><subfield code="a">Smith, David K., (David Kendall)</subfield><subfield code="e">Verfasser</subfield><subfield code="4">aut</subfield></datafield><datafield tag="245" ind1="1" ind2="0"><subfield code="a">Networks and graphs</subfield><subfield code="b">techniques and computational methods</subfield><subfield code="c">David K. Smith</subfield></datafield><datafield tag="264" ind1=" " ind2="1"><subfield code="a">Chichester</subfield><subfield code="b">Horwood Pub.</subfield><subfield code="c">[2003]</subfield></datafield><datafield tag="300" ind1=" " ind2=" "><subfield code="a">1 Online-Ressource (x, 193 pages)</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">c</subfield><subfield code="2">rdamedia</subfield></datafield><datafield tag="338" ind1=" " ind2=" "><subfield code="b">cr</subfield><subfield code="2">rdacarrier</subfield></datafield><datafield tag="500" ind1=" " ind2=" "><subfield code="a">Includes bibliographical references (pages 187-188) and index</subfield></datafield><datafield tag="500" ind1=" " ind2=" "><subfield code="a">Dr Smith here presents essential mathematical and computational ideas of network optimisation for senior undergraduate and postgraduate students in mathematics, computer science and operational research. He shows how algorithms can be used for finding optimal paths and flows, identifying trees in networks, and optimal matching. Later chapters discuss postman and salesperson tours, and demonstrate how many network problems are related to the ''minimal-cost feasible-flow'' problem. Techniques are presented both informally and with mathematical rigour and aspects of computation, especially of complexity, have been included. Numerous examples and diagrams illustrate the techniques and applications. The book also includes problem exercises with tutorial hints. Presents essential mathematical and computational ideas of network optimisation for senior undergraduate and postgraduate students in mathematics, computer science and operational researchDemonstrates how algorithms can be used for finding optimal paths and flows, identifying trees in networks and optimal matchingNumerous examples and diagrams illustrate the techniques and applications</subfield></datafield><datafield tag="650" ind1=" " ind2="7"><subfield code="a">MATHEMATICS / General</subfield><subfield code="2">bisacsh</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Datenverarbeitung</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Graph theory</subfield><subfield code="x">Data processing</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Network analysis (Planning)</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Mathemtaical optimization</subfield></datafield><datafield tag="856" ind1="4" ind2="0"><subfield code="u">http://www.sciencedirect.com/science/book/9781898563914</subfield><subfield code="x">Verlag</subfield><subfield code="3">Volltext</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">ZDB-33-ESD</subfield><subfield code="a">ZDB-33-EBS</subfield></datafield><datafield tag="940" ind1="1" ind2=" "><subfield code="q">FAW_PDA_ESD</subfield></datafield><datafield tag="940" ind1="1" ind2=" "><subfield code="q">FLA_PDA_ESD</subfield></datafield><datafield tag="999" ind1=" " ind2=" "><subfield code="a">oai:aleph.bib-bvb.de:BVB01-027754193</subfield></datafield></record></collection> |
| id | DE-604.BV042317202 |
| illustrated | Not Illustrated |
| indexdate | 2024-07-10T01:18:16Z |
| institution | BVB |
| isbn | 9780857099570 0857099574 1898563918 9781898563914 |
| language | English |
| oai_aleph_id | oai:aleph.bib-bvb.de:BVB01-027754193 |
| oclc_num | 869282256 |
| open_access_boolean | |
| owner | DE-1046 |
| owner_facet | DE-1046 |
| physical | 1 Online-Ressource (x, 193 pages) |
| psigel | ZDB-33-ESD ZDB-33-EBS FAW_PDA_ESD FLA_PDA_ESD |
| publishDate | 2003 |
| publishDateSearch | 2003 |
| publishDateSort | 2003 |
| publisher | Horwood Pub. |
| record_format | marc |
| spelling | Smith, David K., (David Kendall) Verfasser aut Networks and graphs techniques and computational methods David K. Smith Chichester Horwood Pub. [2003] 1 Online-Ressource (x, 193 pages) txt rdacontent c rdamedia cr rdacarrier Includes bibliographical references (pages 187-188) and index Dr Smith here presents essential mathematical and computational ideas of network optimisation for senior undergraduate and postgraduate students in mathematics, computer science and operational research. He shows how algorithms can be used for finding optimal paths and flows, identifying trees in networks, and optimal matching. Later chapters discuss postman and salesperson tours, and demonstrate how many network problems are related to the ''minimal-cost feasible-flow'' problem. Techniques are presented both informally and with mathematical rigour and aspects of computation, especially of complexity, have been included. Numerous examples and diagrams illustrate the techniques and applications. The book also includes problem exercises with tutorial hints. Presents essential mathematical and computational ideas of network optimisation for senior undergraduate and postgraduate students in mathematics, computer science and operational researchDemonstrates how algorithms can be used for finding optimal paths and flows, identifying trees in networks and optimal matchingNumerous examples and diagrams illustrate the techniques and applications MATHEMATICS / General bisacsh Datenverarbeitung Graph theory Data processing Network analysis (Planning) Mathemtaical optimization http://www.sciencedirect.com/science/book/9781898563914 Verlag Volltext |
| spellingShingle | Smith, David K., (David Kendall) Networks and graphs techniques and computational methods MATHEMATICS / General bisacsh Datenverarbeitung Graph theory Data processing Network analysis (Planning) Mathemtaical optimization |
| title | Networks and graphs techniques and computational methods |
| title_auth | Networks and graphs techniques and computational methods |
| title_exact_search | Networks and graphs techniques and computational methods |
| title_full | Networks and graphs techniques and computational methods David K. Smith |
| title_fullStr | Networks and graphs techniques and computational methods David K. Smith |
| title_full_unstemmed | Networks and graphs techniques and computational methods David K. Smith |
| title_short | Networks and graphs |
| title_sort | networks and graphs techniques and computational methods |
| title_sub | techniques and computational methods |
| topic | MATHEMATICS / General bisacsh Datenverarbeitung Graph theory Data processing Network analysis (Planning) Mathemtaical optimization |
| topic_facet | MATHEMATICS / General Datenverarbeitung Graph theory Data processing Network analysis (Planning) Mathemtaical optimization |
| url | http://www.sciencedirect.com/science/book/9781898563914 |
| work_keys_str_mv | AT smithdavidkdavidkendall networksandgraphstechniquesandcomputationalmethods |