Iterative methods in combinatorial optimization:
Gespeichert in:
1. Verfasser: | |
---|---|
Format: | Buch |
Sprache: | English |
Veröffentlicht: |
Cambridge [u.a.]
Cambridge University Press
[2011]
|
Schriftenreihe: | Cambridge texts in applied mathematics
|
Schlagworte: | |
Online-Zugang: | Inhaltsverzeichnis |
Beschreibung: | xi, 242 Seiten Illustrationen |
ISBN: | 9781107007512 1107007518 9780521189439 0521189438 |
Internformat
MARC
LEADER | 00000nam a2200000 c 4500 | ||
---|---|---|---|
001 | BV039132906 | ||
003 | DE-604 | ||
005 | 20230519 | ||
007 | t | ||
008 | 110712s2011 a||| |||| 00||| eng d | ||
020 | |a 9781107007512 |c Hardback |9 978-1-10-700751-2 | ||
020 | |a 1107007518 |9 1-10-700751-8 | ||
020 | |a 9780521189439 |c Paperback |9 978-0-521-18943-9 | ||
020 | |a 0521189438 |9 0-521-18943-8 | ||
035 | |a (OCoLC)741863106 | ||
035 | |a (DE-599)BSZ347084702 | ||
040 | |a DE-604 |b ger |e rda | ||
041 | 0 | |a eng | |
049 | |a DE-634 |a DE-20 |a DE-83 |a DE-739 | ||
082 | 0 | |a 519.64 | |
084 | |a SK 890 |0 (DE-625)143267: |2 rvk | ||
084 | |a 90C27 |2 msc | ||
084 | |a 65K05 |2 msc | ||
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 [u.a.] |b Cambridge University Press |c [2011] | |
264 | 4 | |c © 2011 | |
300 | |a xi, 242 Seiten |b Illustrationen | ||
336 | |b txt |2 rdacontent | ||
337 | |b n |2 rdamedia | ||
338 | |b nc |2 rdacarrier | ||
490 | 0 | |a Cambridge texts in applied mathematics | |
650 | 0 | 7 | |a Kombinatorische Optimierung |0 (DE-588)4031826-6 |2 gnd |9 rswk-swf |
650 | 0 | 7 | |a Iteration |0 (DE-588)4123457-1 |2 gnd |9 rswk-swf |
653 | |a Combinatorial optimization | ||
653 | |a Iterative methods (Mathematics) | ||
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 | |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 | |
856 | 4 | 2 | |m Digitalisierung UB Passau - ADAM Catalogue Enrichment |q application/pdf |u http://bvbr.bib-bvb.de:8991/F?func=service&doc_library=BVB01&local_base=BVB01&doc_number=024151179&sequence=000001&line_number=0001&func_code=DB_RECORDS&service_type=MEDIA |3 Inhaltsverzeichnis |
999 | |a oai:aleph.bib-bvb.de:BVB01-024151179 |
Datensatz im Suchindex
_version_ | 1804147969109262336 |
---|---|
adam_text | Contents Preface page ix 1 Introduction 1.1 The assignment problem 1.2 Iterative algorithm 1.3 Approach outline 1.4 Context and applications of iterative rounding 1.5 Book chapters overview 1.6 Notes 1 1 3 5 8 8 10 2 Preliminaries 2.1 Linear programming 2.2 Graphs and digraphs 2.3 Submodular and supermodular functions 12 12 19 21 3 Matching and vertex cover in bipartite graphs 3.1 Matchings in bipartite graphs 3.2 Generalized assignment problem 3.3 Maximum budgeted allocation 3.4 Vertex cover in bipartite graphs 3.5 Vertex cover and matching: duality 3.6 Notes 28 28 32 35 40 43 44 4 Spanning trees 4.1 Minimum spanning trees 4.2 Iterative 1-edge-finding algorithm 4.3 Minimum bounded-degree spanning trees 4.4 An additive one approximation algorithm 4.5 Notes 46 46 54 57 60 62 v
vi Contents 5 Matroids 5.1 Preliminaries 5.2 Maximum weight basis 5.3 Matroid intersection 5.4 Duality and min-max theorem 5.5 Minimum bounded degree matroid basis 5.6 к matroid intersection 5.7 Notes 6 Arborescence and rooted connectivity 6.1 Minimum cost arborescence 6.2 Minimum cost rooted ^-connected subgraphs 6.3 Minimum bounded degree arborescence 6.4 Additive performance guarantee 6.5 Notes 88 89 95 101 106 108 7 Submodular flows and applications 7.1 The model and the main result 7.2 Primal integrality 7.3 Dual integrality 7.4 Applications of submodular flows 7.5 Minimum bounded degree submodular flows 7.6 Notes 110 110 112 116 117 124 128 8 Network matrices 8.1 The model and main results 8.2 Primal integrality 8.3 Dual integrality 8.4 Applications 8.5 Notes 131 131 133 136 139 143 9 Matchings 9.1 Graph matching 9.2 Hypergraph matching 9.3 Notes 145 145 155 160 10 Network design 10.1 Survivable network design problem 10.2 Connection to the traveling salesman problem 10.3 Minimum bounded degree Steiner networks 10.4 An additive approximation algorithm 10.5 Notes 164 164 168 172 175 179 65 65 67 71 74 77 82 85
Contents 11 Constrained optimization problems 11.1 Vertex cover 11.2 Partial vertex cover 11.3 Multicriteria spanning trees 11.4 Notes 12 Cut problems 12.1 Triangle cover 12.2 Feedback vertex set on bipartite tournaments 12.3 Node multiway cut 12.4 Notes vii 182 182 184 187 189 191 191 194 197 200 13 Iterative relaxation: Early and recent examples 13.1 A discrepancy theorem 13.2 Rearrangments of sums 13.3 Minimum cost circulation 13.4 Minimum cost unsplittable flow 13.5 Bin packing 13.6 Iterative randomized rounding: Steiner trees 13.7 Notes 203 203 206 208 2Ю 14 Summary 231 Bibliography Index 232 241 շլշ 220 շշ8
|
any_adam_object | 1 |
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 | BV039132906 |
classification_rvk | SK 890 |
ctrlnum | (OCoLC)741863106 (DE-599)BSZ347084702 |
dewey-full | 519.64 |
dewey-hundreds | 500 - Natural sciences and mathematics |
dewey-ones | 519 - Probabilities and applied mathematics |
dewey-raw | 519.64 |
dewey-search | 519.64 |
dewey-sort | 3519.64 |
dewey-tens | 510 - Mathematics |
discipline | Mathematik |
format | Book |
fullrecord | <?xml version="1.0" encoding="UTF-8"?><collection xmlns="http://www.loc.gov/MARC21/slim"><record><leader>01947nam a2200481 c 4500</leader><controlfield tag="001">BV039132906</controlfield><controlfield tag="003">DE-604</controlfield><controlfield tag="005">20230519 </controlfield><controlfield tag="007">t</controlfield><controlfield tag="008">110712s2011 a||| |||| 00||| eng d</controlfield><datafield tag="020" ind1=" " ind2=" "><subfield code="a">9781107007512</subfield><subfield code="c">Hardback</subfield><subfield code="9">978-1-10-700751-2</subfield></datafield><datafield tag="020" ind1=" " ind2=" "><subfield code="a">1107007518</subfield><subfield code="9">1-10-700751-8</subfield></datafield><datafield tag="020" ind1=" " ind2=" "><subfield code="a">9780521189439</subfield><subfield code="c">Paperback</subfield><subfield code="9">978-0-521-18943-9</subfield></datafield><datafield tag="020" ind1=" " ind2=" "><subfield code="a">0521189438</subfield><subfield code="9">0-521-18943-8</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(OCoLC)741863106</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(DE-599)BSZ347084702</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="049" ind1=" " ind2=" "><subfield code="a">DE-634</subfield><subfield code="a">DE-20</subfield><subfield code="a">DE-83</subfield><subfield code="a">DE-739</subfield></datafield><datafield tag="082" ind1="0" ind2=" "><subfield code="a">519.64</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">90C27</subfield><subfield code="2">msc</subfield></datafield><datafield tag="084" ind1=" " ind2=" "><subfield code="a">65K05</subfield><subfield code="2">msc</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 [u.a.]</subfield><subfield code="b">Cambridge University Press</subfield><subfield code="c">[2011]</subfield></datafield><datafield tag="264" ind1=" " ind2="4"><subfield code="c">© 2011</subfield></datafield><datafield tag="300" ind1=" " ind2=" "><subfield code="a">xi, 242 Seiten</subfield><subfield code="b">Illustrationen</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="0" ind2=" "><subfield code="a">Cambridge texts in applied mathematics</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="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="653" ind1=" " ind2=" "><subfield code="a">Combinatorial optimization</subfield></datafield><datafield tag="653" ind1=" " ind2=" "><subfield code="a">Iterative methods (Mathematics)</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="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="856" ind1="4" ind2="2"><subfield code="m">Digitalisierung UB Passau - ADAM Catalogue Enrichment</subfield><subfield code="q">application/pdf</subfield><subfield code="u">http://bvbr.bib-bvb.de:8991/F?func=service&doc_library=BVB01&local_base=BVB01&doc_number=024151179&sequence=000001&line_number=0001&func_code=DB_RECORDS&service_type=MEDIA</subfield><subfield code="3">Inhaltsverzeichnis</subfield></datafield><datafield tag="999" ind1=" " ind2=" "><subfield code="a">oai:aleph.bib-bvb.de:BVB01-024151179</subfield></datafield></record></collection> |
id | DE-604.BV039132906 |
illustrated | Illustrated |
indexdate | 2024-07-09T23:59:41Z |
institution | BVB |
isbn | 9781107007512 1107007518 9780521189439 0521189438 |
language | English |
oai_aleph_id | oai:aleph.bib-bvb.de:BVB01-024151179 |
oclc_num | 741863106 |
open_access_boolean | |
owner | DE-634 DE-20 DE-83 DE-739 |
owner_facet | DE-634 DE-20 DE-83 DE-739 |
physical | xi, 242 Seiten Illustrationen |
publishDate | 2011 |
publishDateSearch | 2011 |
publishDateSort | 2011 |
publisher | Cambridge University Press |
record_format | marc |
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 [u.a.] Cambridge University Press [2011] © 2011 xi, 242 Seiten Illustrationen txt rdacontent n rdamedia nc rdacarrier Cambridge texts in applied mathematics Kombinatorische Optimierung (DE-588)4031826-6 gnd rswk-swf Iteration (DE-588)4123457-1 gnd rswk-swf Combinatorial optimization Iterative methods (Mathematics) Kombinatorische Optimierung (DE-588)4031826-6 s Iteration (DE-588)4123457-1 s DE-604 Ravi, Ramamoorthi 1969- Sonstige (DE-588)101593191X oth Singh, Mohit Sonstige (DE-588)1025662261 oth Digitalisierung UB Passau - ADAM Catalogue Enrichment application/pdf http://bvbr.bib-bvb.de:8991/F?func=service&doc_library=BVB01&local_base=BVB01&doc_number=024151179&sequence=000001&line_number=0001&func_code=DB_RECORDS&service_type=MEDIA Inhaltsverzeichnis |
spellingShingle | Lau, Lap Chi Iterative methods in combinatorial optimization Kombinatorische Optimierung (DE-588)4031826-6 gnd Iteration (DE-588)4123457-1 gnd |
subject_GND | (DE-588)4031826-6 (DE-588)4123457-1 |
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 | Kombinatorische Optimierung (DE-588)4031826-6 gnd Iteration (DE-588)4123457-1 gnd |
topic_facet | Kombinatorische Optimierung Iteration |
url | http://bvbr.bib-bvb.de:8991/F?func=service&doc_library=BVB01&local_base=BVB01&doc_number=024151179&sequence=000001&line_number=0001&func_code=DB_RECORDS&service_type=MEDIA |
work_keys_str_mv | AT laulapchi iterativemethodsincombinatorialoptimization AT raviramamoorthi iterativemethodsincombinatorialoptimization AT singhmohit iterativemethodsincombinatorialoptimization |