Iterative methods in combinatorial optimization /:
"With the advent of approximation algorithms for NP-hard combinatorial optimization problems, several techniques from exact optimization such as the primal-dual method have proven their staying power and versatility. This book describes a simple and powerful method that is iterative in essence,...
Gespeichert in:
| 1. Verfasser: | |
|---|---|
| Weitere Verfasser: | , |
| Format: | Elektronisch E-Book |
| Sprache: | English |
| Veröffentlicht: |
Cambridge ; New York :
Cambridge University Press,
©2011.
|
| Schriftenreihe: | Cambridge texts in applied mathematics.
|
| Schlagworte: | |
| Online-Zugang: | Volltext |
| Zusammenfassung: | "With the advent of approximation algorithms for NP-hard combinatorial optimization problems, several techniques from exact optimization such as the primal-dual method have proven their staying power and versatility. This book describes a simple and powerful method that is iterative in essence, and similarly useful in a variety of settings for exact and approximate optimization. The authors highlight the commonality and uses of this method to prove a variety of classical polyhedral results on matchings, trees, matroids, and flows. The presentation style is elementary enough to be accessible to anyone with exposure to basic linear algebra and graph theory, making the book suitable for introductory courses in combinatorial optimization at the upper undergraduate and beginning graduate levels. Discussions of advanced applications illustrate their potential for future application in research in approximation algorithms"-- |
| Beschreibung: | 1 online resource (xi, 242 pages) : illustrations |
| Bibliographie: | Includes bibliographical references (pages 233-240) and index. |
| ISBN: | 9781139081078 1139081071 9781139078801 1139078801 9780511977152 0511977158 9781283111164 1283111160 1107221773 9781107221772 9786613111166 6613111163 1139076523 9781139076524 1139083341 9781139083348 1139070800 9781139070805 |
Internformat
MARC
| LEADER | 00000cam a2200000 a 4500 | ||
|---|---|---|---|
| 001 | ZDB-4-EBA-ocn729716899 | ||
| 003 | OCoLC | ||
| 005 | 20241004212047.0 | ||
| 006 | m o d | ||
| 007 | cr mnu---unuuu | ||
| 008 | 110609s2011 enka ob 001 0 eng d | ||
| 010 | |a 2011003653 | ||
| 040 | |a N$T |b eng |e pn |c N$T |d E7B |d CDX |d OSU |d OCLCQ |d FXR |d REDDC |d OCLCQ |d DEBSZ |d OCLCQ |d CAMBR |d YDXCP |d OCLCQ |d OCLCF |d OCLCQ |d NJR |d COO |d OCLCQ |d COCUF |d STF |d LOA |d VT2 |d OCLCQ |d WYU |d LVT |d OCLCQ |d A6Q |d UHL |d OCLCQ |d UKCRE |d LUN |d UKAHL |d OCLCQ |d OCLCO |d INTCL |d QGK |d OCLCO |d OCLCQ |d OCLCO |d S9M |d OCLCL |d OCLCQ |d OCLCL |d SFB | ||
| 019 | |a 818783672 |a 1042895380 |a 1043678619 |a 1066678480 |a 1081296776 |a 1153055578 |a 1167431727 |a 1228554275 |a 1259245601 | ||
| 020 | |a 9781139081078 |q (electronic bk.) | ||
| 020 | |a 1139081071 |q (electronic bk.) | ||
| 020 | |a 9781139078801 |q (electronic bk.) | ||
| 020 | |a 1139078801 |q (electronic bk.) | ||
| 020 | |a 9780511977152 |q (electronic bk.) | ||
| 020 | |a 0511977158 |q (electronic bk.) | ||
| 020 | |a 9781283111164 | ||
| 020 | |a 1283111160 | ||
| 020 | |z 9781107007512 |q (hardback) | ||
| 020 | |z 1107007518 |q (hardback) | ||
| 020 | |z 9780521189439 |q (pbk.) | ||
| 020 | |z 0521189438 |q (pbk.) | ||
| 020 | |a 1107221773 | ||
| 020 | |a 9781107221772 | ||
| 020 | |a 9786613111166 | ||
| 020 | |a 6613111163 | ||
| 020 | |a 1139076523 | ||
| 020 | |a 9781139076524 | ||
| 020 | |a 1139083341 | ||
| 020 | |a 9781139083348 | ||
| 020 | |a 1139070800 | ||
| 020 | |a 9781139070805 | ||
| 035 | |a (OCoLC)729716899 |z (OCoLC)818783672 |z (OCoLC)1042895380 |z (OCoLC)1043678619 |z (OCoLC)1066678480 |z (OCoLC)1081296776 |z (OCoLC)1153055578 |z (OCoLC)1167431727 |z (OCoLC)1228554275 |z (OCoLC)1259245601 | ||
| 037 | |a 311116 |b MIL | ||
| 050 | 4 | |a QA297.8 |b .L38 2011eb | |
| 072 | 7 | |a MAT |x 041000 |2 bisacsh | |
| 082 | 7 | |a 518/.26 |2 22 | |
| 084 | |a COM000000 |2 bisacsh | ||
| 049 | |a MAIN | ||
| 100 | 1 | |a Lau, Lap Chi. |0 http://id.loc.gov/authorities/names/n2011006981 | |
| 245 | 1 | 0 | |a Iterative methods in combinatorial optimization / |c Lap Chi Lau, R. Ravi, Mohit Singh. |
| 260 | |a Cambridge ; |a New York : |b Cambridge University Press, |c ©2011. | ||
| 300 | |a 1 online resource (xi, 242 pages) : |b illustrations | ||
| 336 | |a text |b txt |2 rdacontent | ||
| 337 | |a computer |b c |2 rdamedia | ||
| 338 | |a online resource |b cr |2 rdacarrier | ||
| 347 | |a data file | ||
| 490 | 1 | |a Cambridge texts in applied mathematics | |
| 520 | |a "With the advent of approximation algorithms for NP-hard combinatorial optimization problems, several techniques from exact optimization such as the primal-dual method have proven their staying power and versatility. This book describes a simple and powerful method that is iterative in essence, and similarly useful in a variety of settings for exact and approximate optimization. The authors highlight the commonality and uses of this method to prove a variety of classical polyhedral results on matchings, trees, matroids, and flows. The presentation style is elementary enough to be accessible to anyone with exposure to basic linear algebra and graph theory, making the book suitable for introductory courses in combinatorial optimization at the upper undergraduate and beginning graduate levels. Discussions of advanced applications illustrate their potential for future application in research in approximation algorithms"-- |c Provided by publisher | ||
| 504 | |a Includes bibliographical references (pages 233-240) and index. | ||
| 505 | 8 | |a Machine generated contents note: 1. Introduction; 2. Preliminaries; 3. Matching and vertex cover in bipartite graphs; 4. Spanning trees; 5. Matroids; 6. Arborescence and rooted connectivity; 7. Submodular flows and applications; 8. Network matrices; 9. Matchings; 10. Network design; 11. Constrained optimization problems; 12. Cut problems; 13. Iterative relaxation: early and recent examples; 14. Summary. | |
| 588 | 0 | |a Print version record. | |
| 546 | |a English. | ||
| 650 | 0 | |a Iterative methods (Mathematics) |0 http://id.loc.gov/authorities/subjects/sh85069058 | |
| 650 | 0 | |a Combinatorial optimization. |0 http://id.loc.gov/authorities/subjects/sh85028809 | |
| 650 | 6 | |a Itération (Mathématiques) | |
| 650 | 6 | |a Optimisation combinatoire. | |
| 650 | 7 | |a COMPUTERS |x General. |2 bisacsh | |
| 650 | 7 | |a MATHEMATICS |x Numerical Analysis. |2 bisacsh | |
| 650 | 7 | |a Optimización combinatoria |2 embne | |
| 650 | 0 | 7 | |a Métodos iterativos (Matemáticas) |2 embucm |
| 650 | 7 | |a Combinatorial optimization |2 fast | |
| 650 | 7 | |a Iterative methods (Mathematics) |2 fast | |
| 655 | 0 | |a Electronic book. | |
| 655 | 4 | |a Electronic books. | |
| 700 | 1 | |a Ravi, R. |q (Ramamoorthi), |d 1969- |1 https://id.oclc.org/worldcat/entity/E39PCjFyQt3XTGdx3mdtWdTGVy |0 http://id.loc.gov/authorities/names/n00003544 | |
| 700 | 1 | |a Singh, Mohit. |0 http://id.loc.gov/authorities/names/n2011006983 | |
| 758 | |i has work: |a Iterative methods in combinatorial optimization (Text) |1 https://id.oclc.org/worldcat/entity/E39PCFxxcpvyJXhBbYwjQPmyBP |4 https://id.oclc.org/worldcat/ontology/hasWork | ||
| 776 | 0 | 8 | |i Print version: |a Lau, Lap Chi. |t Iterative methods in combinatorial optimization. |d Cambridge ; New York : Cambridge University Press, 2011 |z 9781107007512 |w (DLC) 2011003653 |w (OCoLC)694393831 |
| 830 | 0 | |a Cambridge texts in applied mathematics. |0 http://id.loc.gov/authorities/names/n86719346 | |
| 856 | 4 | 0 | |l FWS01 |p ZDB-4-EBA |q FWS_PDA_EBA |u https://search.ebscohost.com/login.aspx?direct=true&scope=site&db=nlebk&AN=366290 |3 Volltext |
| 938 | |a Askews and Holts Library Services |b ASKH |n AH22948829 | ||
| 938 | |a Askews and Holts Library Services |b ASKH |n AH37562300 | ||
| 938 | |a Coutts Information Services |b COUT |n 17930570 | ||
| 938 | |a ebrary |b EBRY |n ebr10470664 | ||
| 938 | |a EBSCOhost |b EBSC |n 366290 | ||
| 938 | |a YBP Library Services |b YANK |n 6898394 | ||
| 938 | |a YBP Library Services |b YANK |n 6929896 | ||
| 938 | |a YBP Library Services |b YANK |n 9248064 | ||
| 938 | |a YBP Library Services |b YANK |n 6137937 | ||
| 994 | |a 92 |b GEBAY | ||
| 912 | |a ZDB-4-EBA | ||
| 049 | |a DE-863 | ||
Datensatz im Suchindex
| DE-BY-FWS_katkey | ZDB-4-EBA-ocn729716899 |
|---|---|
| _version_ | 1816881761498431488 |
| adam_text | |
| any_adam_object | |
| author | Lau, Lap Chi |
| author2 | Ravi, R. (Ramamoorthi), 1969- Singh, Mohit |
| author2_role | |
| author2_variant | r r rr m s ms |
| author_GND | http://id.loc.gov/authorities/names/n2011006981 http://id.loc.gov/authorities/names/n00003544 http://id.loc.gov/authorities/names/n2011006983 |
| author_facet | Lau, Lap Chi Ravi, R. (Ramamoorthi), 1969- Singh, Mohit |
| author_role | |
| author_sort | Lau, Lap Chi |
| author_variant | l c l lc lcl |
| building | Verbundindex |
| bvnumber | localFWS |
| callnumber-first | Q - Science |
| callnumber-label | QA297 |
| callnumber-raw | QA297.8 .L38 2011eb |
| callnumber-search | QA297.8 .L38 2011eb |
| callnumber-sort | QA 3297.8 L38 42011EB |
| callnumber-subject | QA - Mathematics |
| collection | ZDB-4-EBA |
| contents | Machine generated contents note: 1. Introduction; 2. Preliminaries; 3. Matching and vertex cover in bipartite graphs; 4. Spanning trees; 5. Matroids; 6. Arborescence and rooted connectivity; 7. Submodular flows and applications; 8. Network matrices; 9. Matchings; 10. Network design; 11. Constrained optimization problems; 12. Cut problems; 13. Iterative relaxation: early and recent examples; 14. Summary. |
| ctrlnum | (OCoLC)729716899 |
| dewey-full | 518/.26 |
| dewey-hundreds | 500 - Natural sciences and mathematics |
| dewey-ones | 518 - Numerical analysis |
| dewey-raw | 518/.26 |
| dewey-search | 518/.26 |
| dewey-sort | 3518 226 |
| 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>05909cam a2200985 a 4500</leader><controlfield tag="001">ZDB-4-EBA-ocn729716899</controlfield><controlfield tag="003">OCoLC</controlfield><controlfield tag="005">20241004212047.0</controlfield><controlfield tag="006">m o d </controlfield><controlfield tag="007">cr mnu---unuuu</controlfield><controlfield tag="008">110609s2011 enka ob 001 0 eng d</controlfield><datafield tag="010" ind1=" " ind2=" "><subfield code="a"> 2011003653</subfield></datafield><datafield tag="040" ind1=" " ind2=" "><subfield code="a">N$T</subfield><subfield code="b">eng</subfield><subfield code="e">pn</subfield><subfield code="c">N$T</subfield><subfield code="d">E7B</subfield><subfield code="d">CDX</subfield><subfield code="d">OSU</subfield><subfield code="d">OCLCQ</subfield><subfield code="d">FXR</subfield><subfield code="d">REDDC</subfield><subfield code="d">OCLCQ</subfield><subfield code="d">DEBSZ</subfield><subfield code="d">OCLCQ</subfield><subfield code="d">CAMBR</subfield><subfield code="d">YDXCP</subfield><subfield code="d">OCLCQ</subfield><subfield code="d">OCLCF</subfield><subfield code="d">OCLCQ</subfield><subfield code="d">NJR</subfield><subfield code="d">COO</subfield><subfield code="d">OCLCQ</subfield><subfield code="d">COCUF</subfield><subfield code="d">STF</subfield><subfield code="d">LOA</subfield><subfield code="d">VT2</subfield><subfield code="d">OCLCQ</subfield><subfield code="d">WYU</subfield><subfield code="d">LVT</subfield><subfield code="d">OCLCQ</subfield><subfield code="d">A6Q</subfield><subfield code="d">UHL</subfield><subfield code="d">OCLCQ</subfield><subfield code="d">UKCRE</subfield><subfield code="d">LUN</subfield><subfield code="d">UKAHL</subfield><subfield code="d">OCLCQ</subfield><subfield code="d">OCLCO</subfield><subfield code="d">INTCL</subfield><subfield code="d">QGK</subfield><subfield code="d">OCLCO</subfield><subfield code="d">OCLCQ</subfield><subfield code="d">OCLCO</subfield><subfield code="d">S9M</subfield><subfield code="d">OCLCL</subfield><subfield code="d">OCLCQ</subfield><subfield code="d">OCLCL</subfield><subfield code="d">SFB</subfield></datafield><datafield tag="019" ind1=" " ind2=" "><subfield code="a">818783672</subfield><subfield code="a">1042895380</subfield><subfield code="a">1043678619</subfield><subfield code="a">1066678480</subfield><subfield code="a">1081296776</subfield><subfield code="a">1153055578</subfield><subfield code="a">1167431727</subfield><subfield code="a">1228554275</subfield><subfield code="a">1259245601</subfield></datafield><datafield tag="020" ind1=" " ind2=" "><subfield code="a">9781139081078</subfield><subfield code="q">(electronic bk.)</subfield></datafield><datafield tag="020" ind1=" " ind2=" "><subfield code="a">1139081071</subfield><subfield code="q">(electronic bk.)</subfield></datafield><datafield tag="020" ind1=" " ind2=" "><subfield code="a">9781139078801</subfield><subfield code="q">(electronic bk.)</subfield></datafield><datafield tag="020" ind1=" " ind2=" "><subfield code="a">1139078801</subfield><subfield code="q">(electronic bk.)</subfield></datafield><datafield tag="020" ind1=" " ind2=" "><subfield code="a">9780511977152</subfield><subfield code="q">(electronic bk.)</subfield></datafield><datafield tag="020" ind1=" " ind2=" "><subfield code="a">0511977158</subfield><subfield code="q">(electronic bk.)</subfield></datafield><datafield tag="020" ind1=" " ind2=" "><subfield code="a">9781283111164</subfield></datafield><datafield tag="020" ind1=" " ind2=" "><subfield code="a">1283111160</subfield></datafield><datafield tag="020" ind1=" " ind2=" "><subfield code="z">9781107007512</subfield><subfield code="q">(hardback)</subfield></datafield><datafield tag="020" ind1=" " ind2=" "><subfield code="z">1107007518</subfield><subfield code="q">(hardback)</subfield></datafield><datafield tag="020" ind1=" " ind2=" "><subfield code="z">9780521189439</subfield><subfield code="q">(pbk.)</subfield></datafield><datafield tag="020" ind1=" " ind2=" "><subfield code="z">0521189438</subfield><subfield code="q">(pbk.)</subfield></datafield><datafield tag="020" ind1=" " ind2=" "><subfield code="a">1107221773</subfield></datafield><datafield tag="020" ind1=" " ind2=" "><subfield code="a">9781107221772</subfield></datafield><datafield tag="020" ind1=" " ind2=" "><subfield code="a">9786613111166</subfield></datafield><datafield tag="020" ind1=" " ind2=" "><subfield code="a">6613111163</subfield></datafield><datafield tag="020" ind1=" " ind2=" "><subfield code="a">1139076523</subfield></datafield><datafield tag="020" ind1=" " ind2=" "><subfield code="a">9781139076524</subfield></datafield><datafield tag="020" ind1=" " ind2=" "><subfield code="a">1139083341</subfield></datafield><datafield tag="020" ind1=" " ind2=" "><subfield code="a">9781139083348</subfield></datafield><datafield tag="020" ind1=" " ind2=" "><subfield code="a">1139070800</subfield></datafield><datafield tag="020" ind1=" " ind2=" "><subfield code="a">9781139070805</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(OCoLC)729716899</subfield><subfield code="z">(OCoLC)818783672</subfield><subfield code="z">(OCoLC)1042895380</subfield><subfield code="z">(OCoLC)1043678619</subfield><subfield code="z">(OCoLC)1066678480</subfield><subfield code="z">(OCoLC)1081296776</subfield><subfield code="z">(OCoLC)1153055578</subfield><subfield code="z">(OCoLC)1167431727</subfield><subfield code="z">(OCoLC)1228554275</subfield><subfield code="z">(OCoLC)1259245601</subfield></datafield><datafield tag="037" ind1=" " ind2=" "><subfield code="a">311116</subfield><subfield code="b">MIL</subfield></datafield><datafield tag="050" ind1=" " ind2="4"><subfield code="a">QA297.8</subfield><subfield code="b">.L38 2011eb</subfield></datafield><datafield tag="072" ind1=" " ind2="7"><subfield code="a">MAT</subfield><subfield code="x">041000</subfield><subfield code="2">bisacsh</subfield></datafield><datafield tag="082" ind1="7" ind2=" "><subfield code="a">518/.26</subfield><subfield code="2">22</subfield></datafield><datafield tag="084" ind1=" " ind2=" "><subfield code="a">COM000000</subfield><subfield code="2">bisacsh</subfield></datafield><datafield tag="049" ind1=" " ind2=" "><subfield code="a">MAIN</subfield></datafield><datafield tag="100" ind1="1" ind2=" "><subfield code="a">Lau, Lap Chi.</subfield><subfield code="0">http://id.loc.gov/authorities/names/n2011006981</subfield></datafield><datafield tag="245" ind1="1" ind2="0"><subfield code="a">Iterative methods in combinatorial optimization /</subfield><subfield code="c">Lap Chi Lau, R. Ravi, Mohit Singh.</subfield></datafield><datafield tag="260" ind1=" " ind2=" "><subfield code="a">Cambridge ;</subfield><subfield code="a">New York :</subfield><subfield code="b">Cambridge University Press,</subfield><subfield code="c">©2011.</subfield></datafield><datafield tag="300" ind1=" " ind2=" "><subfield code="a">1 online resource (xi, 242 pages) :</subfield><subfield code="b">illustrations</subfield></datafield><datafield tag="336" ind1=" " ind2=" "><subfield code="a">text</subfield><subfield code="b">txt</subfield><subfield code="2">rdacontent</subfield></datafield><datafield tag="337" ind1=" " ind2=" "><subfield code="a">computer</subfield><subfield code="b">c</subfield><subfield code="2">rdamedia</subfield></datafield><datafield tag="338" ind1=" " ind2=" "><subfield code="a">online resource</subfield><subfield code="b">cr</subfield><subfield code="2">rdacarrier</subfield></datafield><datafield tag="347" ind1=" " ind2=" "><subfield code="a">data file</subfield></datafield><datafield tag="490" ind1="1" ind2=" "><subfield code="a">Cambridge texts in applied mathematics</subfield></datafield><datafield tag="520" ind1=" " ind2=" "><subfield code="a">"With the advent of approximation algorithms for NP-hard combinatorial optimization problems, several techniques from exact optimization such as the primal-dual method have proven their staying power and versatility. This book describes a simple and powerful method that is iterative in essence, and similarly useful in a variety of settings for exact and approximate optimization. The authors highlight the commonality and uses of this method to prove a variety of classical polyhedral results on matchings, trees, matroids, and flows. The presentation style is elementary enough to be accessible to anyone with exposure to basic linear algebra and graph theory, making the book suitable for introductory courses in combinatorial optimization at the upper undergraduate and beginning graduate levels. Discussions of advanced applications illustrate their potential for future application in research in approximation algorithms"--</subfield><subfield code="c">Provided by publisher</subfield></datafield><datafield tag="504" ind1=" " ind2=" "><subfield code="a">Includes bibliographical references (pages 233-240) and index.</subfield></datafield><datafield tag="505" ind1="8" ind2=" "><subfield code="a">Machine generated contents note: 1. Introduction; 2. Preliminaries; 3. Matching and vertex cover in bipartite graphs; 4. Spanning trees; 5. Matroids; 6. Arborescence and rooted connectivity; 7. Submodular flows and applications; 8. Network matrices; 9. Matchings; 10. Network design; 11. Constrained optimization problems; 12. Cut problems; 13. Iterative relaxation: early and recent examples; 14. Summary.</subfield></datafield><datafield tag="588" ind1="0" ind2=" "><subfield code="a">Print version record.</subfield></datafield><datafield tag="546" ind1=" " ind2=" "><subfield code="a">English.</subfield></datafield><datafield tag="650" ind1=" " ind2="0"><subfield code="a">Iterative methods (Mathematics)</subfield><subfield code="0">http://id.loc.gov/authorities/subjects/sh85069058</subfield></datafield><datafield tag="650" ind1=" " ind2="0"><subfield code="a">Combinatorial optimization.</subfield><subfield code="0">http://id.loc.gov/authorities/subjects/sh85028809</subfield></datafield><datafield tag="650" ind1=" " ind2="6"><subfield code="a">Itération (Mathématiques)</subfield></datafield><datafield tag="650" ind1=" " ind2="6"><subfield code="a">Optimisation combinatoire.</subfield></datafield><datafield tag="650" ind1=" " ind2="7"><subfield code="a">COMPUTERS</subfield><subfield code="x">General.</subfield><subfield code="2">bisacsh</subfield></datafield><datafield tag="650" ind1=" " ind2="7"><subfield code="a">MATHEMATICS</subfield><subfield code="x">Numerical Analysis.</subfield><subfield code="2">bisacsh</subfield></datafield><datafield tag="650" ind1=" " ind2="7"><subfield code="a">Optimización combinatoria</subfield><subfield code="2">embne</subfield></datafield><datafield tag="650" ind1="0" ind2="7"><subfield code="a">Métodos iterativos (Matemáticas)</subfield><subfield code="2">embucm</subfield></datafield><datafield tag="650" ind1=" " ind2="7"><subfield code="a">Combinatorial optimization</subfield><subfield code="2">fast</subfield></datafield><datafield tag="650" ind1=" " ind2="7"><subfield code="a">Iterative methods (Mathematics)</subfield><subfield code="2">fast</subfield></datafield><datafield tag="655" ind1=" " ind2="0"><subfield code="a">Electronic book.</subfield></datafield><datafield tag="655" ind1=" " ind2="4"><subfield code="a">Electronic books.</subfield></datafield><datafield tag="700" ind1="1" ind2=" "><subfield code="a">Ravi, R.</subfield><subfield code="q">(Ramamoorthi),</subfield><subfield code="d">1969-</subfield><subfield code="1">https://id.oclc.org/worldcat/entity/E39PCjFyQt3XTGdx3mdtWdTGVy</subfield><subfield code="0">http://id.loc.gov/authorities/names/n00003544</subfield></datafield><datafield tag="700" ind1="1" ind2=" "><subfield code="a">Singh, Mohit.</subfield><subfield code="0">http://id.loc.gov/authorities/names/n2011006983</subfield></datafield><datafield tag="758" ind1=" " ind2=" "><subfield code="i">has work:</subfield><subfield code="a">Iterative methods in combinatorial optimization (Text)</subfield><subfield code="1">https://id.oclc.org/worldcat/entity/E39PCFxxcpvyJXhBbYwjQPmyBP</subfield><subfield code="4">https://id.oclc.org/worldcat/ontology/hasWork</subfield></datafield><datafield tag="776" ind1="0" ind2="8"><subfield code="i">Print version:</subfield><subfield code="a">Lau, Lap Chi.</subfield><subfield code="t">Iterative methods in combinatorial optimization.</subfield><subfield code="d">Cambridge ; New York : Cambridge University Press, 2011</subfield><subfield code="z">9781107007512</subfield><subfield code="w">(DLC) 2011003653</subfield><subfield code="w">(OCoLC)694393831</subfield></datafield><datafield tag="830" ind1=" " ind2="0"><subfield code="a">Cambridge texts in applied mathematics.</subfield><subfield code="0">http://id.loc.gov/authorities/names/n86719346</subfield></datafield><datafield tag="856" ind1="4" ind2="0"><subfield code="l">FWS01</subfield><subfield code="p">ZDB-4-EBA</subfield><subfield code="q">FWS_PDA_EBA</subfield><subfield code="u">https://search.ebscohost.com/login.aspx?direct=true&scope=site&db=nlebk&AN=366290</subfield><subfield code="3">Volltext</subfield></datafield><datafield tag="938" ind1=" " ind2=" "><subfield code="a">Askews and Holts Library Services</subfield><subfield code="b">ASKH</subfield><subfield code="n">AH22948829</subfield></datafield><datafield tag="938" ind1=" " ind2=" "><subfield code="a">Askews and Holts Library Services</subfield><subfield code="b">ASKH</subfield><subfield code="n">AH37562300</subfield></datafield><datafield tag="938" ind1=" " ind2=" "><subfield code="a">Coutts Information Services</subfield><subfield code="b">COUT</subfield><subfield code="n">17930570</subfield></datafield><datafield tag="938" ind1=" " ind2=" "><subfield code="a">ebrary</subfield><subfield code="b">EBRY</subfield><subfield code="n">ebr10470664</subfield></datafield><datafield tag="938" ind1=" " ind2=" "><subfield code="a">EBSCOhost</subfield><subfield code="b">EBSC</subfield><subfield code="n">366290</subfield></datafield><datafield tag="938" ind1=" " ind2=" "><subfield code="a">YBP Library Services</subfield><subfield code="b">YANK</subfield><subfield code="n">6898394</subfield></datafield><datafield tag="938" ind1=" " ind2=" "><subfield code="a">YBP Library Services</subfield><subfield code="b">YANK</subfield><subfield code="n">6929896</subfield></datafield><datafield tag="938" ind1=" " ind2=" "><subfield code="a">YBP Library Services</subfield><subfield code="b">YANK</subfield><subfield code="n">9248064</subfield></datafield><datafield tag="938" ind1=" " ind2=" "><subfield code="a">YBP Library Services</subfield><subfield code="b">YANK</subfield><subfield code="n">6137937</subfield></datafield><datafield tag="994" ind1=" " ind2=" "><subfield code="a">92</subfield><subfield code="b">GEBAY</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">ZDB-4-EBA</subfield></datafield><datafield tag="049" ind1=" " ind2=" "><subfield code="a">DE-863</subfield></datafield></record></collection> |
| genre | Electronic book. Electronic books. |
| genre_facet | Electronic book. Electronic books. |
| id | ZDB-4-EBA-ocn729716899 |
| illustrated | Illustrated |
| indexdate | 2024-11-27T13:17:51Z |
| institution | BVB |
| isbn | 9781139081078 1139081071 9781139078801 1139078801 9780511977152 0511977158 9781283111164 1283111160 1107221773 9781107221772 9786613111166 6613111163 1139076523 9781139076524 1139083341 9781139083348 1139070800 9781139070805 |
| language | English |
| lccn | 2011003653 |
| oclc_num | 729716899 |
| open_access_boolean | |
| owner | MAIN DE-863 DE-BY-FWS |
| owner_facet | MAIN DE-863 DE-BY-FWS |
| physical | 1 online resource (xi, 242 pages) : illustrations |
| psigel | ZDB-4-EBA |
| publishDate | 2011 |
| publishDateSearch | 2011 |
| publishDateSort | 2011 |
| publisher | Cambridge University Press, |
| record_format | marc |
| series | Cambridge texts in applied mathematics. |
| series2 | Cambridge texts in applied mathematics |
| spelling | Lau, Lap Chi. http://id.loc.gov/authorities/names/n2011006981 Iterative methods in combinatorial optimization / Lap Chi Lau, R. Ravi, Mohit Singh. Cambridge ; New York : Cambridge University Press, ©2011. 1 online resource (xi, 242 pages) : illustrations text txt rdacontent computer c rdamedia online resource cr rdacarrier data file Cambridge texts in applied mathematics "With the advent of approximation algorithms for NP-hard combinatorial optimization problems, several techniques from exact optimization such as the primal-dual method have proven their staying power and versatility. This book describes a simple and powerful method that is iterative in essence, and similarly useful in a variety of settings for exact and approximate optimization. The authors highlight the commonality and uses of this method to prove a variety of classical polyhedral results on matchings, trees, matroids, and flows. The presentation style is elementary enough to be accessible to anyone with exposure to basic linear algebra and graph theory, making the book suitable for introductory courses in combinatorial optimization at the upper undergraduate and beginning graduate levels. Discussions of advanced applications illustrate their potential for future application in research in approximation algorithms"-- Provided by publisher Includes bibliographical references (pages 233-240) and index. Machine generated contents note: 1. Introduction; 2. Preliminaries; 3. Matching and vertex cover in bipartite graphs; 4. Spanning trees; 5. Matroids; 6. Arborescence and rooted connectivity; 7. Submodular flows and applications; 8. Network matrices; 9. Matchings; 10. Network design; 11. Constrained optimization problems; 12. Cut problems; 13. Iterative relaxation: early and recent examples; 14. Summary. Print version record. English. Iterative methods (Mathematics) http://id.loc.gov/authorities/subjects/sh85069058 Combinatorial optimization. http://id.loc.gov/authorities/subjects/sh85028809 Itération (Mathématiques) Optimisation combinatoire. COMPUTERS General. bisacsh MATHEMATICS Numerical Analysis. bisacsh Optimización combinatoria embne Métodos iterativos (Matemáticas) embucm Combinatorial optimization fast Iterative methods (Mathematics) fast Electronic book. Electronic books. Ravi, R. (Ramamoorthi), 1969- https://id.oclc.org/worldcat/entity/E39PCjFyQt3XTGdx3mdtWdTGVy http://id.loc.gov/authorities/names/n00003544 Singh, Mohit. http://id.loc.gov/authorities/names/n2011006983 has work: Iterative methods in combinatorial optimization (Text) https://id.oclc.org/worldcat/entity/E39PCFxxcpvyJXhBbYwjQPmyBP https://id.oclc.org/worldcat/ontology/hasWork Print version: Lau, Lap Chi. Iterative methods in combinatorial optimization. Cambridge ; New York : Cambridge University Press, 2011 9781107007512 (DLC) 2011003653 (OCoLC)694393831 Cambridge texts in applied mathematics. http://id.loc.gov/authorities/names/n86719346 FWS01 ZDB-4-EBA FWS_PDA_EBA https://search.ebscohost.com/login.aspx?direct=true&scope=site&db=nlebk&AN=366290 Volltext |
| spellingShingle | Lau, Lap Chi Iterative methods in combinatorial optimization / Cambridge texts in applied mathematics. Machine generated contents note: 1. Introduction; 2. Preliminaries; 3. Matching and vertex cover in bipartite graphs; 4. Spanning trees; 5. Matroids; 6. Arborescence and rooted connectivity; 7. Submodular flows and applications; 8. Network matrices; 9. Matchings; 10. Network design; 11. Constrained optimization problems; 12. Cut problems; 13. Iterative relaxation: early and recent examples; 14. Summary. Iterative methods (Mathematics) http://id.loc.gov/authorities/subjects/sh85069058 Combinatorial optimization. http://id.loc.gov/authorities/subjects/sh85028809 Itération (Mathématiques) Optimisation combinatoire. COMPUTERS General. bisacsh MATHEMATICS Numerical Analysis. bisacsh Optimización combinatoria embne Métodos iterativos (Matemáticas) embucm Combinatorial optimization fast Iterative methods (Mathematics) fast |
| subject_GND | http://id.loc.gov/authorities/subjects/sh85069058 http://id.loc.gov/authorities/subjects/sh85028809 |
| title | Iterative methods in combinatorial optimization / |
| title_auth | Iterative methods in combinatorial optimization / |
| title_exact_search | Iterative methods in combinatorial optimization / |
| title_full | Iterative methods in combinatorial optimization / Lap Chi Lau, R. Ravi, Mohit Singh. |
| title_fullStr | Iterative methods in combinatorial optimization / Lap Chi Lau, R. Ravi, Mohit Singh. |
| title_full_unstemmed | Iterative methods in combinatorial optimization / Lap Chi Lau, R. Ravi, Mohit Singh. |
| title_short | Iterative methods in combinatorial optimization / |
| title_sort | iterative methods in combinatorial optimization |
| topic | Iterative methods (Mathematics) http://id.loc.gov/authorities/subjects/sh85069058 Combinatorial optimization. http://id.loc.gov/authorities/subjects/sh85028809 Itération (Mathématiques) Optimisation combinatoire. COMPUTERS General. bisacsh MATHEMATICS Numerical Analysis. bisacsh Optimización combinatoria embne Métodos iterativos (Matemáticas) embucm Combinatorial optimization fast Iterative methods (Mathematics) fast |
| topic_facet | Iterative methods (Mathematics) Combinatorial optimization. Itération (Mathématiques) Optimisation combinatoire. COMPUTERS General. MATHEMATICS Numerical Analysis. Optimización combinatoria Métodos iterativos (Matemáticas) Combinatorial optimization Electronic book. Electronic books. |
| url | https://search.ebscohost.com/login.aspx?direct=true&scope=site&db=nlebk&AN=366290 |
| work_keys_str_mv | AT laulapchi iterativemethodsincombinatorialoptimization AT ravir iterativemethodsincombinatorialoptimization AT singhmohit iterativemethodsincombinatorialoptimization |