Assignment problems:
Gespeichert in:
Hauptverfasser: | , , |
---|---|
Format: | Elektronisch E-Book |
Sprache: | English |
Veröffentlicht: |
Philadelphia, Pa.
SIAM, Society for Industrial and Applied Mathematics
2012
|
Ausgabe: | revised reprint |
Schriftenreihe: | Other titles in applied mathematics
106 |
Schlagworte: | |
Online-Zugang: | DE-91 DE-20 DE-706 Volltext |
Beschreibung: | Assignment Problems is a useful tool for researchers, practitioners, and graduate students. It provides a comprehensive treatment of assignment problems from their conceptual beginnings in the 1920s through present-day theoretical, algorithmic, and practical developments. The authors have organised the book into 10 self-contained chapters to make it easy for readers to use the specific chapters without having to read the book linearly. The topics covered include bipartite matching algorithms, linear assignment problems, quadratic assignment problems, multi-index assignment problems, and many variations of these problems. Researchers will benefit from the detailed exposition of theory and algorithms related to assignment problems, including the basic linear sum assignment problem and its variations. Practitioners will learn about practical applications of the methods, the performance of exact and heuristic algorithms, and software options. This book also can serve as a text for advanced courses in discrete mathematics, integer programming, combinatorial optimization, and algorithmic computer science. |
Beschreibung: | 1 Online-Ressource (xxii, 393 Seiten) Illustrationen |
DOI: | 10.1137/1.9781611972238 |
Internformat
MARC
LEADER | 00000nmm a2200000 cb4500 | ||
---|---|---|---|
001 | BV046951382 | ||
003 | DE-604 | ||
005 | 20240722 | ||
007 | cr|uuu---uuuuu | ||
008 | 201020s2012 sz |||| o||u| ||||||eng d | ||
020 | |z 9781611972238 |c electronic book |9 978-1-61197-223-8 | ||
024 | 7 | |a 10.1137/1.9781611972238 |2 doi | |
035 | |a (OCoLC)1220890154 | ||
035 | |a (DE-599)BVBBV046951382 | ||
040 | |a DE-604 |b ger |e rda | ||
041 | 0 | |a eng | |
044 | |a sz |c XA-CH | ||
049 | |a DE-83 |a DE-20 |a DE-706 |a DE-91 | ||
084 | |a QH 234 |0 (DE-625)141549: |2 rvk | ||
084 | |a SK 890 |0 (DE-625)143267: |2 rvk | ||
084 | |a SK 970 |0 (DE-625)143276: |2 rvk | ||
100 | 1 | |a Burkard, Rainer E. |d 1943- |0 (DE-588)122621662 |4 aut | |
245 | 1 | 0 | |a Assignment problems |c Rainer Burkard, Graz University of Technology, Graz, Austria; Mauro Dell'Amico, University of Modena and Reggio Emilia, Reggio Emilia, Italy; Silvano Martello, University of Bologna, Bologna, Italy |
250 | |a revised reprint | ||
264 | 1 | |a Philadelphia, Pa. |b SIAM, Society for Industrial and Applied Mathematics |c 2012 | |
300 | |a 1 Online-Ressource (xxii, 393 Seiten) |b Illustrationen | ||
336 | |b txt |2 rdacontent | ||
337 | |b c |2 rdamedia | ||
338 | |b cr |2 rdacarrier | ||
490 | 1 | |a Other titles in applied mathematics |v 106 | |
500 | |a Assignment Problems is a useful tool for researchers, practitioners, and graduate students. It provides a comprehensive treatment of assignment problems from their conceptual beginnings in the 1920s through present-day theoretical, algorithmic, and practical developments. The authors have organised the book into 10 self-contained chapters to make it easy for readers to use the specific chapters without having to read the book linearly. The topics covered include bipartite matching algorithms, linear assignment problems, quadratic assignment problems, multi-index assignment problems, and many variations of these problems. Researchers will benefit from the detailed exposition of theory and algorithms related to assignment problems, including the basic linear sum assignment problem and its variations. Practitioners will learn about practical applications of the methods, the performance of exact and heuristic algorithms, and software options. This book also can serve as a text for advanced courses in discrete mathematics, integer programming, combinatorial optimization, and algorithmic computer science. | ||
650 | 4 | |a Informatik | |
650 | 4 | |a Mathematik | |
650 | 4 | |a Assignment problems (Programming) | |
650 | 4 | |a Computer science / Mathematics | |
650 | 0 | 7 | |a Zuordnungsproblem |0 (DE-588)4068123-3 |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 Zuordnungsproblem |0 (DE-588)4068123-3 |D s |
689 | 0 | |5 DE-604 | |
700 | 1 | |a Dell'Amico, Mauro |d 1960- |0 (DE-588)137770863 |4 aut | |
700 | 1 | |a Martello, Silvano |d 1948- |0 (DE-588)137770812 |4 aut | |
776 | 0 | 8 | |i Erscheint auch als |n Druckausgabe |z 978-1-61197-222-1 |
830 | 0 | |a Other titles in applied mathematics |v 106 |w (DE-604)BV040633124 |9 106 | |
856 | 4 | 0 | |u https://doi.org/10.1137/1.9781611972238 |x Verlag |z URL des Erstveröffentlichers |3 Volltext |
912 | |a ZDB-72-SIA | ||
943 | 1 | |a oai:aleph.bib-bvb.de:BVB01-032359893 | |
966 | e | |u https://doi.org/10.1137/1.9781611972238 |l DE-91 |p ZDB-72-SIA |q TUM_Paketkauf_2012 |x Verlag |3 Volltext | |
966 | e | |u https://doi.org/10.1137/1.9781611972238 |l DE-20 |p ZDB-72-SIA |x Verlag |3 Volltext | |
966 | e | |u https://doi.org/10.1137/1.9781611972238 |l DE-706 |p ZDB-72-SIA |x Verlag |3 Volltext |
Datensatz im Suchindex
_version_ | 1807956464664313856 |
---|---|
adam_text | |
adam_txt | |
any_adam_object | |
any_adam_object_boolean | |
author | Burkard, Rainer E. 1943- Dell'Amico, Mauro 1960- Martello, Silvano 1948- |
author_GND | (DE-588)122621662 (DE-588)137770863 (DE-588)137770812 |
author_facet | Burkard, Rainer E. 1943- Dell'Amico, Mauro 1960- Martello, Silvano 1948- |
author_role | aut aut aut |
author_sort | Burkard, Rainer E. 1943- |
author_variant | r e b re reb m d md s m sm |
building | Verbundindex |
bvnumber | BV046951382 |
classification_rvk | QH 234 SK 890 SK 970 |
collection | ZDB-72-SIA |
ctrlnum | (OCoLC)1220890154 (DE-599)BVBBV046951382 |
discipline | Mathematik Wirtschaftswissenschaften |
discipline_str_mv | Mathematik Wirtschaftswissenschaften |
doi_str_mv | 10.1137/1.9781611972238 |
edition | revised reprint |
format | Electronic eBook |
fullrecord | <?xml version="1.0" encoding="UTF-8"?><collection xmlns="http://www.loc.gov/MARC21/slim"><record><leader>00000nmm a2200000 cb4500</leader><controlfield tag="001">BV046951382</controlfield><controlfield tag="003">DE-604</controlfield><controlfield tag="005">20240722</controlfield><controlfield tag="007">cr|uuu---uuuuu</controlfield><controlfield tag="008">201020s2012 sz |||| o||u| ||||||eng d</controlfield><datafield tag="020" ind1=" " ind2=" "><subfield code="z">9781611972238</subfield><subfield code="c">electronic book</subfield><subfield code="9">978-1-61197-223-8</subfield></datafield><datafield tag="024" ind1="7" ind2=" "><subfield code="a">10.1137/1.9781611972238</subfield><subfield code="2">doi</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(OCoLC)1220890154</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(DE-599)BVBBV046951382</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="044" ind1=" " ind2=" "><subfield code="a">sz</subfield><subfield code="c">XA-CH</subfield></datafield><datafield tag="049" ind1=" " ind2=" "><subfield code="a">DE-83</subfield><subfield code="a">DE-20</subfield><subfield code="a">DE-706</subfield><subfield code="a">DE-91</subfield></datafield><datafield tag="084" ind1=" " ind2=" "><subfield code="a">QH 234</subfield><subfield code="0">(DE-625)141549:</subfield><subfield code="2">rvk</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">SK 970</subfield><subfield code="0">(DE-625)143276:</subfield><subfield code="2">rvk</subfield></datafield><datafield tag="100" ind1="1" ind2=" "><subfield code="a">Burkard, Rainer E.</subfield><subfield code="d">1943-</subfield><subfield code="0">(DE-588)122621662</subfield><subfield code="4">aut</subfield></datafield><datafield tag="245" ind1="1" ind2="0"><subfield code="a">Assignment problems</subfield><subfield code="c">Rainer Burkard, Graz University of Technology, Graz, Austria; Mauro Dell'Amico, University of Modena and Reggio Emilia, Reggio Emilia, Italy; Silvano Martello, University of Bologna, Bologna, Italy</subfield></datafield><datafield tag="250" ind1=" " ind2=" "><subfield code="a">revised reprint</subfield></datafield><datafield tag="264" ind1=" " ind2="1"><subfield code="a">Philadelphia, Pa.</subfield><subfield code="b">SIAM, Society for Industrial and Applied Mathematics</subfield><subfield code="c">2012</subfield></datafield><datafield tag="300" ind1=" " ind2=" "><subfield code="a">1 Online-Ressource (xxii, 393 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">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">Other titles in applied mathematics</subfield><subfield code="v">106</subfield></datafield><datafield tag="500" ind1=" " ind2=" "><subfield code="a">Assignment Problems is a useful tool for researchers, practitioners, and graduate students. It provides a comprehensive treatment of assignment problems from their conceptual beginnings in the 1920s through present-day theoretical, algorithmic, and practical developments. The authors have organised the book into 10 self-contained chapters to make it easy for readers to use the specific chapters without having to read the book linearly. The topics covered include bipartite matching algorithms, linear assignment problems, quadratic assignment problems, multi-index assignment problems, and many variations of these problems. Researchers will benefit from the detailed exposition of theory and algorithms related to assignment problems, including the basic linear sum assignment problem and its variations. Practitioners will learn about practical applications of the methods, the performance of exact and heuristic algorithms, and software options. This book also can serve as a text for advanced courses in discrete mathematics, integer programming, combinatorial optimization, and algorithmic computer science.</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Informatik</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Mathematik</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Assignment problems (Programming)</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Computer science / Mathematics</subfield></datafield><datafield tag="650" ind1="0" ind2="7"><subfield code="a">Zuordnungsproblem</subfield><subfield code="0">(DE-588)4068123-3</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">Zuordnungsproblem</subfield><subfield code="0">(DE-588)4068123-3</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">Dell'Amico, Mauro</subfield><subfield code="d">1960-</subfield><subfield code="0">(DE-588)137770863</subfield><subfield code="4">aut</subfield></datafield><datafield tag="700" ind1="1" ind2=" "><subfield code="a">Martello, Silvano</subfield><subfield code="d">1948-</subfield><subfield code="0">(DE-588)137770812</subfield><subfield code="4">aut</subfield></datafield><datafield tag="776" ind1="0" ind2="8"><subfield code="i">Erscheint auch als</subfield><subfield code="n">Druckausgabe</subfield><subfield code="z">978-1-61197-222-1</subfield></datafield><datafield tag="830" ind1=" " ind2="0"><subfield code="a">Other titles in applied mathematics</subfield><subfield code="v">106</subfield><subfield code="w">(DE-604)BV040633124</subfield><subfield code="9">106</subfield></datafield><datafield tag="856" ind1="4" ind2="0"><subfield code="u">https://doi.org/10.1137/1.9781611972238</subfield><subfield code="x">Verlag</subfield><subfield code="z">URL des Erstveröffentlichers</subfield><subfield code="3">Volltext</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">ZDB-72-SIA</subfield></datafield><datafield tag="943" ind1="1" ind2=" "><subfield code="a">oai:aleph.bib-bvb.de:BVB01-032359893</subfield></datafield><datafield tag="966" ind1="e" ind2=" "><subfield code="u">https://doi.org/10.1137/1.9781611972238</subfield><subfield code="l">DE-91</subfield><subfield code="p">ZDB-72-SIA</subfield><subfield code="q">TUM_Paketkauf_2012</subfield><subfield code="x">Verlag</subfield><subfield code="3">Volltext</subfield></datafield><datafield tag="966" ind1="e" ind2=" "><subfield code="u">https://doi.org/10.1137/1.9781611972238</subfield><subfield code="l">DE-20</subfield><subfield code="p">ZDB-72-SIA</subfield><subfield code="x">Verlag</subfield><subfield code="3">Volltext</subfield></datafield><datafield tag="966" ind1="e" ind2=" "><subfield code="u">https://doi.org/10.1137/1.9781611972238</subfield><subfield code="l">DE-706</subfield><subfield code="p">ZDB-72-SIA</subfield><subfield code="x">Verlag</subfield><subfield code="3">Volltext</subfield></datafield></record></collection> |
id | DE-604.BV046951382 |
illustrated | Not Illustrated |
index_date | 2024-07-03T15:41:17Z |
indexdate | 2024-08-21T00:54:05Z |
institution | BVB |
language | English |
oai_aleph_id | oai:aleph.bib-bvb.de:BVB01-032359893 |
oclc_num | 1220890154 |
open_access_boolean | |
owner | DE-83 DE-20 DE-706 DE-91 DE-BY-TUM |
owner_facet | DE-83 DE-20 DE-706 DE-91 DE-BY-TUM |
physical | 1 Online-Ressource (xxii, 393 Seiten) Illustrationen |
psigel | ZDB-72-SIA ZDB-72-SIA TUM_Paketkauf_2012 |
publishDate | 2012 |
publishDateSearch | 2012 |
publishDateSort | 2012 |
publisher | SIAM, Society for Industrial and Applied Mathematics |
record_format | marc |
series | Other titles in applied mathematics |
series2 | Other titles in applied mathematics |
spelling | Burkard, Rainer E. 1943- (DE-588)122621662 aut Assignment problems Rainer Burkard, Graz University of Technology, Graz, Austria; Mauro Dell'Amico, University of Modena and Reggio Emilia, Reggio Emilia, Italy; Silvano Martello, University of Bologna, Bologna, Italy revised reprint Philadelphia, Pa. SIAM, Society for Industrial and Applied Mathematics 2012 1 Online-Ressource (xxii, 393 Seiten) Illustrationen txt rdacontent c rdamedia cr rdacarrier Other titles in applied mathematics 106 Assignment Problems is a useful tool for researchers, practitioners, and graduate students. It provides a comprehensive treatment of assignment problems from their conceptual beginnings in the 1920s through present-day theoretical, algorithmic, and practical developments. The authors have organised the book into 10 self-contained chapters to make it easy for readers to use the specific chapters without having to read the book linearly. The topics covered include bipartite matching algorithms, linear assignment problems, quadratic assignment problems, multi-index assignment problems, and many variations of these problems. Researchers will benefit from the detailed exposition of theory and algorithms related to assignment problems, including the basic linear sum assignment problem and its variations. Practitioners will learn about practical applications of the methods, the performance of exact and heuristic algorithms, and software options. This book also can serve as a text for advanced courses in discrete mathematics, integer programming, combinatorial optimization, and algorithmic computer science. Informatik Mathematik Assignment problems (Programming) Computer science / Mathematics Zuordnungsproblem (DE-588)4068123-3 gnd rswk-swf Kombinatorische Optimierung (DE-588)4031826-6 gnd rswk-swf Kombinatorische Optimierung (DE-588)4031826-6 s Zuordnungsproblem (DE-588)4068123-3 s DE-604 Dell'Amico, Mauro 1960- (DE-588)137770863 aut Martello, Silvano 1948- (DE-588)137770812 aut Erscheint auch als Druckausgabe 978-1-61197-222-1 Other titles in applied mathematics 106 (DE-604)BV040633124 106 https://doi.org/10.1137/1.9781611972238 Verlag URL des Erstveröffentlichers Volltext |
spellingShingle | Burkard, Rainer E. 1943- Dell'Amico, Mauro 1960- Martello, Silvano 1948- Assignment problems Other titles in applied mathematics Informatik Mathematik Assignment problems (Programming) Computer science / Mathematics Zuordnungsproblem (DE-588)4068123-3 gnd Kombinatorische Optimierung (DE-588)4031826-6 gnd |
subject_GND | (DE-588)4068123-3 (DE-588)4031826-6 |
title | Assignment problems |
title_auth | Assignment problems |
title_exact_search | Assignment problems |
title_exact_search_txtP | Assignment problems |
title_full | Assignment problems Rainer Burkard, Graz University of Technology, Graz, Austria; Mauro Dell'Amico, University of Modena and Reggio Emilia, Reggio Emilia, Italy; Silvano Martello, University of Bologna, Bologna, Italy |
title_fullStr | Assignment problems Rainer Burkard, Graz University of Technology, Graz, Austria; Mauro Dell'Amico, University of Modena and Reggio Emilia, Reggio Emilia, Italy; Silvano Martello, University of Bologna, Bologna, Italy |
title_full_unstemmed | Assignment problems Rainer Burkard, Graz University of Technology, Graz, Austria; Mauro Dell'Amico, University of Modena and Reggio Emilia, Reggio Emilia, Italy; Silvano Martello, University of Bologna, Bologna, Italy |
title_short | Assignment problems |
title_sort | assignment problems |
topic | Informatik Mathematik Assignment problems (Programming) Computer science / Mathematics Zuordnungsproblem (DE-588)4068123-3 gnd Kombinatorische Optimierung (DE-588)4031826-6 gnd |
topic_facet | Informatik Mathematik Assignment problems (Programming) Computer science / Mathematics Zuordnungsproblem Kombinatorische Optimierung |
url | https://doi.org/10.1137/1.9781611972238 |
volume_link | (DE-604)BV040633124 |
work_keys_str_mv | AT burkardrainere assignmentproblems AT dellamicomauro assignmentproblems AT martellosilvano assignmentproblems |