Iterative methods in combinatorial optimization / Lap Chi Lau, R. Ravi, Mohit Singh.
"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:
Superior document: | Cambridge texts in applied mathematics |
---|---|
: | |
TeilnehmendeR: | |
Year of Publication: | 2011 |
Language: | English |
Series: | Cambridge texts in applied mathematics.
|
Online Access: | |
Physical Description: | xi, 242 p. :; ill. |
Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
id |
500691988 |
---|---|
ctrlnum |
(MiAaPQ)500691988 (Au-PeEL)EBL691988 (CaPaEBR)ebr10470664 (CaONFJC)MIL311116 (OCoLC)726734811 |
collection |
bib_alma |
record_format |
marc |
spelling |
Lau, Lap Chi. Iterative methods in combinatorial optimization [electronic resource] / Lap Chi Lau, R. Ravi, Mohit Singh. Cambridge ; New York : Cambridge University Press, 2011. xi, 242 p. : ill. Cambridge texts in applied mathematics Includes bibliographical references 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. "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. "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. Electronic reproduction. Ann Arbor, MI : ProQuest, 2015. Available via World Wide Web. Access may be limited to ProQuest affiliated libraries. Iterative methods (Mathematics) Combinatorial optimization. Electronic books. Ravi, R. (Ramamoorthi), 1969- Singh, Mohit. ProQuest (Firm) Cambridge texts in applied mathematics. https://ebookcentral.proquest.com/lib/oeawat/detail.action?docID=691988 Click to View |
language |
English |
format |
Electronic eBook |
author |
Lau, Lap Chi. |
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. |
author_facet |
Lau, Lap Chi. Ravi, R. 1969- Singh, Mohit. ProQuest (Firm) ProQuest (Firm) |
author_variant |
l c l lc lcl |
author2 |
Ravi, R. 1969- Singh, Mohit. ProQuest (Firm) |
author2_variant |
r r rr m s ms |
author2_fuller |
(Ramamoorthi), |
author2_role |
TeilnehmendeR TeilnehmendeR TeilnehmendeR |
author_corporate |
ProQuest (Firm) |
author_sort |
Lau, Lap Chi. |
title |
Iterative methods in combinatorial optimization |
title_full |
Iterative methods in combinatorial optimization [electronic resource] / Lap Chi Lau, R. Ravi, Mohit Singh. |
title_fullStr |
Iterative methods in combinatorial optimization [electronic resource] / Lap Chi Lau, R. Ravi, Mohit Singh. |
title_full_unstemmed |
Iterative methods in combinatorial optimization [electronic resource] / Lap Chi Lau, R. Ravi, Mohit Singh. |
title_auth |
Iterative methods in combinatorial optimization |
title_new |
Iterative methods in combinatorial optimization |
title_sort |
iterative methods in combinatorial optimization |
series |
Cambridge texts in applied mathematics |
series2 |
Cambridge texts in applied mathematics |
publisher |
Cambridge University Press, |
publishDate |
2011 |
physical |
xi, 242 p. : ill. |
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. |
isbn |
9781139081078 (electronic bk.) |
callnumber-first |
Q - Science |
callnumber-subject |
QA - Mathematics |
callnumber-label |
QA297 |
callnumber-sort |
QA 3297.8 L38 42011 |
genre |
Electronic books. |
genre_facet |
Electronic books. |
url |
https://ebookcentral.proquest.com/lib/oeawat/detail.action?docID=691988 |
illustrated |
Illustrated |
dewey-hundreds |
500 - Science |
dewey-tens |
510 - Mathematics |
dewey-ones |
518 - Numerical analysis |
dewey-full |
518/.26 |
dewey-sort |
3518 226 |
dewey-raw |
518/.26 |
dewey-search |
518/.26 |
oclc_num |
726734811 |
work_keys_str_mv |
AT laulapchi iterativemethodsincombinatorialoptimization AT ravir iterativemethodsincombinatorialoptimization AT singhmohit iterativemethodsincombinatorialoptimization AT proquestfirm iterativemethodsincombinatorialoptimization |
status_str |
n |
ids_txt_mv |
(MiAaPQ)500691988 (Au-PeEL)EBL691988 (CaPaEBR)ebr10470664 (CaONFJC)MIL311116 (OCoLC)726734811 |
hierarchy_parent_title |
Cambridge texts in applied mathematics |
is_hierarchy_title |
Iterative methods in combinatorial optimization |
container_title |
Cambridge texts in applied mathematics |
author2_original_writing_str_mv |
noLinkedField noLinkedField noLinkedField |
_version_ |
1792330713645711360 |
fullrecord |
<?xml version="1.0" encoding="UTF-8"?><collection xmlns="http://www.loc.gov/MARC21/slim"><record><leader>03941nam a2200457 a 4500</leader><controlfield tag="001">500691988</controlfield><controlfield tag="003">MiAaPQ</controlfield><controlfield tag="005">20200520144314.0</controlfield><controlfield tag="006">m o d | </controlfield><controlfield tag="007">cr cn|||||||||</controlfield><controlfield tag="008">110202s2011 enka sb 001 0 eng d</controlfield><datafield tag="010" ind1=" " ind2=" "><subfield code="z"> 2011003653</subfield></datafield><datafield tag="020" ind1=" " ind2=" "><subfield code="z">9781107007512 (hardback)</subfield></datafield><datafield tag="020" ind1=" " ind2=" "><subfield code="z">9780521189439 (pbk.)</subfield></datafield><datafield tag="020" ind1=" " ind2=" "><subfield code="a">9781139081078 (electronic bk.)</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(MiAaPQ)500691988</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(Au-PeEL)EBL691988</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(CaPaEBR)ebr10470664</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(CaONFJC)MIL311116</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(OCoLC)726734811</subfield></datafield><datafield tag="040" ind1=" " ind2=" "><subfield code="a">MiAaPQ</subfield><subfield code="c">MiAaPQ</subfield><subfield code="d">MiAaPQ</subfield></datafield><datafield tag="050" ind1=" " ind2="4"><subfield code="a">QA297.8</subfield><subfield code="b">.L38 2011</subfield></datafield><datafield tag="082" ind1="0" ind2="4"><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></datafield><datafield tag="245" ind1="1" ind2="0"><subfield code="a">Iterative methods in combinatorial optimization</subfield><subfield code="h">[electronic resource] /</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">xi, 242 p. :</subfield><subfield code="b">ill.</subfield></datafield><datafield tag="490" ind1="1" ind2=" "><subfield code="a">Cambridge texts in applied mathematics</subfield></datafield><datafield tag="504" ind1=" " ind2=" "><subfield code="a">Includes bibliographical references 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="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="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="533" ind1=" " ind2=" "><subfield code="a">Electronic reproduction. Ann Arbor, MI : ProQuest, 2015. Available via World Wide Web. Access may be limited to ProQuest affiliated libraries.</subfield></datafield><datafield tag="650" ind1=" " ind2="0"><subfield code="a">Iterative methods (Mathematics)</subfield></datafield><datafield tag="650" ind1=" " ind2="0"><subfield code="a">Combinatorial optimization.</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></datafield><datafield tag="700" ind1="1" ind2=" "><subfield code="a">Singh, Mohit.</subfield></datafield><datafield tag="710" ind1="2" ind2=" "><subfield code="a">ProQuest (Firm)</subfield></datafield><datafield tag="830" ind1=" " ind2="0"><subfield code="a">Cambridge texts in applied mathematics.</subfield></datafield><datafield tag="856" ind1="4" ind2="0"><subfield code="u">https://ebookcentral.proquest.com/lib/oeawat/detail.action?docID=691988</subfield><subfield code="z">Click to View</subfield></datafield></record></collection> |