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,...
Saved in:
| Main Author: | |
|---|---|
| Format: | Electronic eBook |
| Language: | English |
| Published: |
Cambridge ; New York
Cambridge University Press
2011
|
| Series: | Cambridge texts in applied mathematics
46 |
| Subjects: | |
| Summary: | "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"-- "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"-- |
| Physical Description: | xi, 242 p. ill |
Staff View
MARC
| LEADER | 00000nam a2200000zcb4500 | ||
|---|---|---|---|
| 001 | BV045252458 | ||
| 003 | DE-604 | ||
| 005 | 20250423 | ||
| 007 | cr|uuu---uuuuu | ||
| 008 | 181026s2011 xx a||| o|||| 00||| eng d | ||
| 035 | |a (ZDB-30-PAD)EBC691988 | ||
| 035 | |a (ZDB-89-EBL)EBL691988 | ||
| 035 | |a (ZDB-38-EBR)ebr10470664 | ||
| 035 | |a (OCoLC)726734811 | ||
| 035 | |a (DE-599)BVBBV045252458 | ||
| 040 | |a DE-604 |b ger |e rda | ||
| 041 | 0 | |a eng | |
| 082 | 0 | |a 518/.26 |2 22 | |
| 100 | 1 | |a Lau, Lap Chi |e Verfasser |0 (DE-588)1015930654 |4 aut | |
| 245 | 1 | 0 | |a Iterative methods in combinatorial optimization |c Lap Chi Lau, R. Ravi, Mohit Singh |
| 264 | 1 | |a Cambridge ; New York |b Cambridge University Press |c 2011 | |
| 300 | |a xi, 242 p. |b ill | ||
| 336 | |b txt |2 rdacontent | ||
| 337 | |b c |2 rdamedia | ||
| 338 | |b cr |2 rdacarrier | ||
| 490 | 1 | |a Cambridge texts in applied mathematics |v 46 | |
| 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"-- | ||
| 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"-- | ||
| 650 | 4 | |a Iterative methods (Mathematics) | |
| 650 | 4 | |a Combinatorial optimization | |
| 650 | 0 | 7 | |a Iteration |0 (DE-588)4123457-1 |2 gnd |9 rswk-swf |
| 650 | 0 | 7 | |a Kombinatorische Optimierung |0 (DE-588)4031826-6 |2 gnd |9 rswk-swf |
| 689 | 0 | 0 | |a Kombinatorische Optimierung |0 (DE-588)4031826-6 |D s |
| 689 | 0 | 1 | |a Iteration |0 (DE-588)4123457-1 |D s |
| 689 | 0 | |8 1\p |5 DE-604 | |
| 700 | 1 | |a Ravi, Ramamoorthi |d 1969- |e Sonstige |0 (DE-588)101593191X |4 oth | |
| 700 | 1 | |a Singh, Mohit |e Sonstige |0 (DE-588)1025662261 |4 oth | |
| 710 | 2 | |a ProQuest (Firm) |e Sonstige |4 oth | |
| 830 | 0 | |a Cambridge texts in applied mathematics |v 46 |w (DE-604)BV046998082 |9 46 | |
| 883 | 1 | |8 1\p |a cgwrk |d 20201028 |q DE-101 |u https://d-nb.info/provenance/plan#cgwrk | |
| 912 | |a ZDB-30-PAD | ||
| 943 | 1 | |a oai:aleph.bib-bvb.de:BVB01-030640434 | |
Record in the Search Index
| _version_ | 1830187140082827264 |
|---|---|
| adam_text | |
| any_adam_object | |
| author | Lau, Lap Chi |
| author_GND | (DE-588)1015930654 (DE-588)101593191X (DE-588)1025662261 |
| author_facet | Lau, Lap Chi |
| author_role | aut |
| author_sort | Lau, Lap Chi |
| author_variant | l c l lc lcl |
| building | Verbundindex |
| bvnumber | BV045252458 |
| collection | ZDB-30-PAD |
| ctrlnum | (ZDB-30-PAD)EBC691988 (ZDB-89-EBL)EBL691988 (ZDB-38-EBR)ebr10470664 (OCoLC)726734811 (DE-599)BVBBV045252458 |
| 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>00000nam a2200000zcb4500</leader><controlfield tag="001">BV045252458</controlfield><controlfield tag="003">DE-604</controlfield><controlfield tag="005">20250423</controlfield><controlfield tag="007">cr|uuu---uuuuu</controlfield><controlfield tag="008">181026s2011 xx a||| o|||| 00||| eng d</controlfield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(ZDB-30-PAD)EBC691988</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(ZDB-89-EBL)EBL691988</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(ZDB-38-EBR)ebr10470664</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(OCoLC)726734811</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(DE-599)BVBBV045252458</subfield></datafield><datafield tag="040" ind1=" " ind2=" "><subfield code="a">DE-604</subfield><subfield code="b">ger</subfield><subfield code="e">rda</subfield></datafield><datafield tag="041" ind1="0" ind2=" "><subfield code="a">eng</subfield></datafield><datafield tag="082" ind1="0" ind2=" "><subfield code="a">518/.26</subfield><subfield code="2">22</subfield></datafield><datafield tag="100" ind1="1" ind2=" "><subfield code="a">Lau, Lap Chi</subfield><subfield code="e">Verfasser</subfield><subfield code="0">(DE-588)1015930654</subfield><subfield code="4">aut</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="264" ind1=" " ind2="1"><subfield code="a">Cambridge ; New York</subfield><subfield code="b">Cambridge University Press</subfield><subfield code="c">2011</subfield></datafield><datafield tag="300" ind1=" " ind2=" "><subfield code="a">xi, 242 p.</subfield><subfield code="b">ill</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="490" ind1="1" ind2=" "><subfield code="a">Cambridge texts in applied mathematics</subfield><subfield code="v">46</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></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></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Iterative methods (Mathematics)</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Combinatorial optimization</subfield></datafield><datafield tag="650" ind1="0" ind2="7"><subfield code="a">Iteration</subfield><subfield code="0">(DE-588)4123457-1</subfield><subfield code="2">gnd</subfield><subfield code="9">rswk-swf</subfield></datafield><datafield tag="650" ind1="0" ind2="7"><subfield code="a">Kombinatorische Optimierung</subfield><subfield code="0">(DE-588)4031826-6</subfield><subfield code="2">gnd</subfield><subfield code="9">rswk-swf</subfield></datafield><datafield tag="689" ind1="0" ind2="0"><subfield code="a">Kombinatorische Optimierung</subfield><subfield code="0">(DE-588)4031826-6</subfield><subfield code="D">s</subfield></datafield><datafield tag="689" ind1="0" ind2="1"><subfield code="a">Iteration</subfield><subfield code="0">(DE-588)4123457-1</subfield><subfield code="D">s</subfield></datafield><datafield tag="689" ind1="0" ind2=" "><subfield code="8">1\p</subfield><subfield code="5">DE-604</subfield></datafield><datafield tag="700" ind1="1" ind2=" "><subfield code="a">Ravi, Ramamoorthi</subfield><subfield code="d">1969-</subfield><subfield code="e">Sonstige</subfield><subfield code="0">(DE-588)101593191X</subfield><subfield code="4">oth</subfield></datafield><datafield tag="700" ind1="1" ind2=" "><subfield code="a">Singh, Mohit</subfield><subfield code="e">Sonstige</subfield><subfield code="0">(DE-588)1025662261</subfield><subfield code="4">oth</subfield></datafield><datafield tag="710" ind1="2" ind2=" "><subfield code="a">ProQuest (Firm)</subfield><subfield code="e">Sonstige</subfield><subfield code="4">oth</subfield></datafield><datafield tag="830" ind1=" " ind2="0"><subfield code="a">Cambridge texts in applied mathematics</subfield><subfield code="v">46</subfield><subfield code="w">(DE-604)BV046998082</subfield><subfield code="9">46</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="912" ind1=" " ind2=" "><subfield code="a">ZDB-30-PAD</subfield></datafield><datafield tag="943" ind1="1" ind2=" "><subfield code="a">oai:aleph.bib-bvb.de:BVB01-030640434</subfield></datafield></record></collection> |
| id | DE-604.BV045252458 |
| illustrated | Illustrated |
| indexdate | 2025-04-23T10:01:09Z |
| institution | BVB |
| language | English |
| oai_aleph_id | oai:aleph.bib-bvb.de:BVB01-030640434 |
| oclc_num | 726734811 |
| open_access_boolean | |
| physical | xi, 242 p. ill |
| psigel | ZDB-30-PAD |
| 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 Verfasser (DE-588)1015930654 aut Iterative methods in combinatorial optimization Lap Chi Lau, R. Ravi, Mohit Singh Cambridge ; New York Cambridge University Press 2011 xi, 242 p. ill txt rdacontent c rdamedia cr rdacarrier Cambridge texts in applied mathematics 46 "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"-- "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"-- Iterative methods (Mathematics) Combinatorial optimization Iteration (DE-588)4123457-1 gnd rswk-swf Kombinatorische Optimierung (DE-588)4031826-6 gnd rswk-swf Kombinatorische Optimierung (DE-588)4031826-6 s Iteration (DE-588)4123457-1 s 1\p DE-604 Ravi, Ramamoorthi 1969- Sonstige (DE-588)101593191X oth Singh, Mohit Sonstige (DE-588)1025662261 oth ProQuest (Firm) Sonstige oth Cambridge texts in applied mathematics 46 (DE-604)BV046998082 46 1\p cgwrk 20201028 DE-101 https://d-nb.info/provenance/plan#cgwrk |
| spellingShingle | Lau, Lap Chi Iterative methods in combinatorial optimization Iterative methods (Mathematics) Combinatorial optimization Iteration (DE-588)4123457-1 gnd Kombinatorische Optimierung (DE-588)4031826-6 gnd Cambridge texts in applied mathematics |
| subject_GND | (DE-588)4123457-1 (DE-588)4031826-6 |
| 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) Combinatorial optimization Iteration (DE-588)4123457-1 gnd Kombinatorische Optimierung (DE-588)4031826-6 gnd |
| topic_facet | Iterative methods (Mathematics) Combinatorial optimization Iteration Kombinatorische Optimierung |
| volume_link | (DE-604)BV046998082 |
| work_keys_str_mv | AT laulapchi iterativemethodsincombinatorialoptimization AT raviramamoorthi iterativemethodsincombinatorialoptimization AT singhmohit iterativemethodsincombinatorialoptimization AT proquestfirm iterativemethodsincombinatorialoptimization |