A first course in combinatorial optimization / Jon Lee.

Saved in:
Bibliographic Details
Superior document:Cambridge texts in applied mathematics
:
TeilnehmendeR:
Year of Publication:2004
Language:English
Series:Cambridge texts in applied mathematics.
Online Access:
Physical Description:xvi, 211 p. :; ill.
Tags: Add Tag
No Tags, Be the first to tag this record!
id 500256650
ctrlnum (MiAaPQ)500256650
(Au-PeEL)EBL256650
(CaPaEBR)ebr10124656
(OCoLC)80244805
collection bib_alma
fullrecord <?xml version="1.0" encoding="UTF-8"?><collection xmlns="http://www.loc.gov/MARC21/slim"><record><leader>01673nam a2200397Ia 4500</leader><controlfield tag="001">500256650</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">040106s2004 enka sb 001 0 eng d</controlfield><datafield tag="010" ind1=" " ind2=" "><subfield code="z"> 2004040681</subfield></datafield><datafield tag="020" ind1=" " ind2=" "><subfield code="z">0511187831</subfield></datafield><datafield tag="020" ind1=" " ind2=" "><subfield code="z">0521811511</subfield></datafield><datafield tag="020" ind1=" " ind2=" "><subfield code="z">0521010128 (pbk.)</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(MiAaPQ)500256650</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(Au-PeEL)EBL256650</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(CaPaEBR)ebr10124656</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(OCoLC)80244805</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">QA402.5</subfield><subfield code="b">.L394 2004</subfield></datafield><datafield tag="082" ind1="0" ind2="4"><subfield code="a">519.6/4</subfield><subfield code="2">22</subfield></datafield><datafield tag="100" ind1="1" ind2=" "><subfield code="a">Lee, Jon,</subfield><subfield code="d">1960-</subfield></datafield><datafield tag="245" ind1="1" ind2="2"><subfield code="a">A first course in combinatorial optimization</subfield><subfield code="h">[electronic resource] /</subfield><subfield code="c">Jon Lee.</subfield></datafield><datafield tag="260" ind1=" " ind2=" "><subfield code="a">Cambridge, UK ;</subfield><subfield code="a">New York :</subfield><subfield code="b">Cambridge University Press,</subfield><subfield code="c">2004.</subfield></datafield><datafield tag="300" ind1=" " ind2=" "><subfield code="a">xvi, 211 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 (p. 207-208) and indexes.</subfield></datafield><datafield tag="505" ind1="0" ind2=" "><subfield code="a">Polytopes and Linear Programming -- 1. Matroids and the Greedy Algorithm -- 2. Minimum-Weight Dipaths -- 3. Matroid Intersection -- 4. Matching -- 5. Flows and Cuts -- 6. Cutting Planes -- 7. Branch-&amp;-Bound -- 8. Optimizing Submodular Functions.</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">Combinatorial optimization.</subfield></datafield><datafield tag="650" ind1=" " ind2="0"><subfield code="a">Combinatorial analysis.</subfield></datafield><datafield tag="655" ind1=" " ind2="4"><subfield code="a">Electronic books.</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=256650</subfield><subfield code="z">Click to View</subfield></datafield></record></collection>
record_format marc
spelling Lee, Jon, 1960-
A first course in combinatorial optimization [electronic resource] / Jon Lee.
Cambridge, UK ; New York : Cambridge University Press, 2004.
xvi, 211 p. : ill.
Cambridge texts in applied mathematics
Includes bibliographical references (p. 207-208) and indexes.
Polytopes and Linear Programming -- 1. Matroids and the Greedy Algorithm -- 2. Minimum-Weight Dipaths -- 3. Matroid Intersection -- 4. Matching -- 5. Flows and Cuts -- 6. Cutting Planes -- 7. Branch-&-Bound -- 8. Optimizing Submodular Functions.
Electronic reproduction. Ann Arbor, MI : ProQuest, 2015. Available via World Wide Web. Access may be limited to ProQuest affiliated libraries.
Combinatorial optimization.
Combinatorial analysis.
Electronic books.
ProQuest (Firm)
Cambridge texts in applied mathematics.
https://ebookcentral.proquest.com/lib/oeawat/detail.action?docID=256650 Click to View
language English
format Electronic
eBook
author Lee, Jon, 1960-
spellingShingle Lee, Jon, 1960-
A first course in combinatorial optimization
Cambridge texts in applied mathematics
Polytopes and Linear Programming -- 1. Matroids and the Greedy Algorithm -- 2. Minimum-Weight Dipaths -- 3. Matroid Intersection -- 4. Matching -- 5. Flows and Cuts -- 6. Cutting Planes -- 7. Branch-&-Bound -- 8. Optimizing Submodular Functions.
author_facet Lee, Jon, 1960-
ProQuest (Firm)
ProQuest (Firm)
author_variant j l jl
author2 ProQuest (Firm)
author2_role TeilnehmendeR
author_corporate ProQuest (Firm)
author_sort Lee, Jon, 1960-
title A first course in combinatorial optimization
title_full A first course in combinatorial optimization [electronic resource] / Jon Lee.
title_fullStr A first course in combinatorial optimization [electronic resource] / Jon Lee.
title_full_unstemmed A first course in combinatorial optimization [electronic resource] / Jon Lee.
title_auth A first course in combinatorial optimization
title_new A first course in combinatorial optimization
title_sort a first course in combinatorial optimization
series Cambridge texts in applied mathematics
series2 Cambridge texts in applied mathematics
publisher Cambridge University Press,
publishDate 2004
physical xvi, 211 p. : ill.
contents Polytopes and Linear Programming -- 1. Matroids and the Greedy Algorithm -- 2. Minimum-Weight Dipaths -- 3. Matroid Intersection -- 4. Matching -- 5. Flows and Cuts -- 6. Cutting Planes -- 7. Branch-&-Bound -- 8. Optimizing Submodular Functions.
callnumber-first Q - Science
callnumber-subject QA - Mathematics
callnumber-label QA402
callnumber-sort QA 3402.5 L394 42004
genre Electronic books.
genre_facet Electronic books.
url https://ebookcentral.proquest.com/lib/oeawat/detail.action?docID=256650
illustrated Illustrated
dewey-hundreds 500 - Science
dewey-tens 510 - Mathematics
dewey-ones 519 - Probabilities & applied mathematics
dewey-full 519.6/4
dewey-sort 3519.6 14
dewey-raw 519.6/4
dewey-search 519.6/4
oclc_num 80244805
work_keys_str_mv AT leejon afirstcourseincombinatorialoptimization
AT proquestfirm afirstcourseincombinatorialoptimization
AT leejon firstcourseincombinatorialoptimization
AT proquestfirm firstcourseincombinatorialoptimization
status_str n
ids_txt_mv (MiAaPQ)500256650
(Au-PeEL)EBL256650
(CaPaEBR)ebr10124656
(OCoLC)80244805
hierarchy_parent_title Cambridge texts in applied mathematics
is_hierarchy_title A first course in combinatorial optimization
container_title Cambridge texts in applied mathematics
author2_original_writing_str_mv noLinkedField
_version_ 1792330672494346240