Advances in combinatorial optimization: linear programming formulations of the traveling salesman and other hard combinatorial optimization problems
"Combinational optimization (CO) is a topic in applied mathematics, decision science and computer science that consists of finding the best solution from a non-exhaustive search. CO is related to disciplines such as computational complexity theory and algorithm theory, and has important applica...
Gespeichert in:
| 1. Verfasser: | |
|---|---|
| Format: | Elektronisch E-Book |
| Sprache: | English |
| Veröffentlicht: |
Singapore
World Scientific Publishing Co. Pte. Ltd.
© 2016
|
| Schlagworte: | |
| Online-Zugang: | FHN01 Volltext |
| Zusammenfassung: | "Combinational optimization (CO) is a topic in applied mathematics, decision science and computer science that consists of finding the best solution from a non-exhaustive search. CO is related to disciplines such as computational complexity theory and algorithm theory, and has important applications in fields such as operations research/management science, artificial intelligence, machine learning, and software engineering. Advances in Combinatorial Optimization presents a generalized framework for formulating hard combinatorial optimization problems (COPs) as polynomial sized linear programs. Though developed based on the 'traveling salesman problem' (TSP), the framework allows for the formulating of many of the well-known NP-Complete COPs directly (without the need to reduce them to other COPs) as linear programs, and demonstrates the same for three other problems (e.g. the 'vertex coloring problem' (VCP)). This work also represents a proof of the equality of the complexity classes "P" (polynomial time) and "NP" (nondeterministic polynomial time), and makes a contribution to the theory and application of 'extended formulations' (EFs). On a whole, Advances in Combinatorial Optimization offers new modeling and solution perspectives which will be useful to professionals, graduate students and researchers who are either involved in routing, scheduling and sequencing decision-making in particular, or in dealing with the theory of computing in general."-- |
| Beschreibung: | Title from PDF file title page (viewed February 13, 2016) |
| Beschreibung: | 1 online resource (xiv, 203 p.) ill |
| ISBN: | 9789814704885 |
Internformat
MARC
| LEADER | 00000nmm a2200000zc 4500 | ||
|---|---|---|---|
| 001 | BV044640767 | ||
| 003 | DE-604 | ||
| 005 | 00000000000000.0 | ||
| 007 | cr|uuu---uuuuu | ||
| 008 | 171120s2016 |||| o||u| ||||||eng d | ||
| 020 | |a 9789814704885 |c ebook |9 978-981-4704-88-5 | ||
| 024 | 7 | |a 10.1142/9725 |2 doi | |
| 035 | |a (ZDB-124-WOP)00009725 | ||
| 035 | |a (OCoLC)988733075 | ||
| 035 | |a (DE-599)BVBBV044640767 | ||
| 040 | |a DE-604 |b ger |e aacr | ||
| 041 | 0 | |a eng | |
| 049 | |a DE-92 | ||
| 082 | 0 | |a 519.6/4 |2 23 | |
| 100 | 1 | |a Diaby, Moustapha |e Verfasser |4 aut | |
| 245 | 1 | 0 | |a Advances in combinatorial optimization |b linear programming formulations of the traveling salesman and other hard combinatorial optimization problems |c Moustapha Diaby, Mark H. Karwan |
| 264 | 1 | |a Singapore |b World Scientific Publishing Co. Pte. Ltd. |c © 2016 | |
| 300 | |a 1 online resource (xiv, 203 p.) |b ill | ||
| 336 | |b txt |2 rdacontent | ||
| 337 | |b c |2 rdamedia | ||
| 338 | |b cr |2 rdacarrier | ||
| 500 | |a Title from PDF file title page (viewed February 13, 2016) | ||
| 520 | |a "Combinational optimization (CO) is a topic in applied mathematics, decision science and computer science that consists of finding the best solution from a non-exhaustive search. CO is related to disciplines such as computational complexity theory and algorithm theory, and has important applications in fields such as operations research/management science, artificial intelligence, machine learning, and software engineering. Advances in Combinatorial Optimization presents a generalized framework for formulating hard combinatorial optimization problems (COPs) as polynomial sized linear programs. Though developed based on the 'traveling salesman problem' (TSP), the framework allows for the formulating of many of the well-known NP-Complete COPs directly (without the need to reduce them to other COPs) as linear programs, and demonstrates the same for three other problems (e.g. the 'vertex coloring problem' (VCP)). This work also represents a proof of the equality of the complexity classes "P" (polynomial time) and "NP" (nondeterministic polynomial time), and makes a contribution to the theory and application of 'extended formulations' (EFs). On a whole, Advances in Combinatorial Optimization offers new modeling and solution perspectives which will be useful to professionals, graduate students and researchers who are either involved in routing, scheduling and sequencing decision-making in particular, or in dealing with the theory of computing in general."-- | ||
| 650 | 4 | |a Combinatorial optimization | |
| 650 | 4 | |a Mathematical optimization | |
| 650 | 0 | 7 | |a Optimierungsproblem |0 (DE-588)4390818-4 |2 gnd |9 rswk-swf |
| 689 | 0 | 0 | |a Optimierungsproblem |0 (DE-588)4390818-4 |D s |
| 689 | 0 | |8 1\p |5 DE-604 | |
| 700 | 1 | |a Karwan, Mark H. |d 1951- |e Sonstige |4 oth | |
| 856 | 4 | 0 | |u http://www.worldscientific.com/worldscibooks/10.1142/9725#t=toc |x Verlag |z URL des Erstveroeffentlichers |3 Volltext |
| 912 | |a ZDB-124-WOP | ||
| 999 | |a oai:aleph.bib-bvb.de:BVB01-030038739 | ||
| 883 | 1 | |8 1\p |a cgwrk |d 20201028 |q DE-101 |u https://d-nb.info/provenance/plan#cgwrk | |
| 966 | e | |u http://www.worldscientific.com/worldscibooks/10.1142/9725#t=toc |l FHN01 |p ZDB-124-WOP |q FHN_PDA_WOP |x Verlag |3 Volltext | |
Datensatz im Suchindex
| _version_ | 1804178060828737536 |
|---|---|
| any_adam_object | |
| author | Diaby, Moustapha |
| author_facet | Diaby, Moustapha |
| author_role | aut |
| author_sort | Diaby, Moustapha |
| author_variant | m d md |
| building | Verbundindex |
| bvnumber | BV044640767 |
| collection | ZDB-124-WOP |
| ctrlnum | (ZDB-124-WOP)00009725 (OCoLC)988733075 (DE-599)BVBBV044640767 |
| dewey-full | 519.6/4 |
| dewey-hundreds | 500 - Natural sciences and mathematics |
| dewey-ones | 519 - Probabilities and applied mathematics |
| dewey-raw | 519.6/4 |
| dewey-search | 519.6/4 |
| dewey-sort | 3519.6 14 |
| 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>03239nmm a2200433zc 4500</leader><controlfield tag="001">BV044640767</controlfield><controlfield tag="003">DE-604</controlfield><controlfield tag="005">00000000000000.0</controlfield><controlfield tag="007">cr|uuu---uuuuu</controlfield><controlfield tag="008">171120s2016 |||| o||u| ||||||eng d</controlfield><datafield tag="020" ind1=" " ind2=" "><subfield code="a">9789814704885</subfield><subfield code="c">ebook</subfield><subfield code="9">978-981-4704-88-5</subfield></datafield><datafield tag="024" ind1="7" ind2=" "><subfield code="a">10.1142/9725</subfield><subfield code="2">doi</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(ZDB-124-WOP)00009725</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(OCoLC)988733075</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(DE-599)BVBBV044640767</subfield></datafield><datafield tag="040" ind1=" " ind2=" "><subfield code="a">DE-604</subfield><subfield code="b">ger</subfield><subfield code="e">aacr</subfield></datafield><datafield tag="041" ind1="0" ind2=" "><subfield code="a">eng</subfield></datafield><datafield tag="049" ind1=" " ind2=" "><subfield code="a">DE-92</subfield></datafield><datafield tag="082" ind1="0" ind2=" "><subfield code="a">519.6/4</subfield><subfield code="2">23</subfield></datafield><datafield tag="100" ind1="1" ind2=" "><subfield code="a">Diaby, Moustapha</subfield><subfield code="e">Verfasser</subfield><subfield code="4">aut</subfield></datafield><datafield tag="245" ind1="1" ind2="0"><subfield code="a">Advances in combinatorial optimization</subfield><subfield code="b">linear programming formulations of the traveling salesman and other hard combinatorial optimization problems</subfield><subfield code="c">Moustapha Diaby, Mark H. Karwan</subfield></datafield><datafield tag="264" ind1=" " ind2="1"><subfield code="a">Singapore</subfield><subfield code="b">World Scientific Publishing Co. Pte. Ltd.</subfield><subfield code="c">© 2016</subfield></datafield><datafield tag="300" ind1=" " ind2=" "><subfield code="a">1 online resource (xiv, 203 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="500" ind1=" " ind2=" "><subfield code="a">Title from PDF file title page (viewed February 13, 2016)</subfield></datafield><datafield tag="520" ind1=" " ind2=" "><subfield code="a">"Combinational optimization (CO) is a topic in applied mathematics, decision science and computer science that consists of finding the best solution from a non-exhaustive search. CO is related to disciplines such as computational complexity theory and algorithm theory, and has important applications in fields such as operations research/management science, artificial intelligence, machine learning, and software engineering. Advances in Combinatorial Optimization presents a generalized framework for formulating hard combinatorial optimization problems (COPs) as polynomial sized linear programs. Though developed based on the 'traveling salesman problem' (TSP), the framework allows for the formulating of many of the well-known NP-Complete COPs directly (without the need to reduce them to other COPs) as linear programs, and demonstrates the same for three other problems (e.g. the 'vertex coloring problem' (VCP)). This work also represents a proof of the equality of the complexity classes "P" (polynomial time) and "NP" (nondeterministic polynomial time), and makes a contribution to the theory and application of 'extended formulations' (EFs). On a whole, Advances in Combinatorial Optimization offers new modeling and solution perspectives which will be useful to professionals, graduate students and researchers who are either involved in routing, scheduling and sequencing decision-making in particular, or in dealing with the theory of computing in general."--</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Combinatorial optimization</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Mathematical optimization</subfield></datafield><datafield tag="650" ind1="0" ind2="7"><subfield code="a">Optimierungsproblem</subfield><subfield code="0">(DE-588)4390818-4</subfield><subfield code="2">gnd</subfield><subfield code="9">rswk-swf</subfield></datafield><datafield tag="689" ind1="0" ind2="0"><subfield code="a">Optimierungsproblem</subfield><subfield code="0">(DE-588)4390818-4</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">Karwan, Mark H.</subfield><subfield code="d">1951-</subfield><subfield code="e">Sonstige</subfield><subfield code="4">oth</subfield></datafield><datafield tag="856" ind1="4" ind2="0"><subfield code="u">http://www.worldscientific.com/worldscibooks/10.1142/9725#t=toc</subfield><subfield code="x">Verlag</subfield><subfield code="z">URL des Erstveroeffentlichers</subfield><subfield code="3">Volltext</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">ZDB-124-WOP</subfield></datafield><datafield tag="999" ind1=" " ind2=" "><subfield code="a">oai:aleph.bib-bvb.de:BVB01-030038739</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="966" ind1="e" ind2=" "><subfield code="u">http://www.worldscientific.com/worldscibooks/10.1142/9725#t=toc</subfield><subfield code="l">FHN01</subfield><subfield code="p">ZDB-124-WOP</subfield><subfield code="q">FHN_PDA_WOP</subfield><subfield code="x">Verlag</subfield><subfield code="3">Volltext</subfield></datafield></record></collection> |
| id | DE-604.BV044640767 |
| illustrated | Not Illustrated |
| indexdate | 2024-07-10T07:57:58Z |
| institution | BVB |
| isbn | 9789814704885 |
| language | English |
| oai_aleph_id | oai:aleph.bib-bvb.de:BVB01-030038739 |
| oclc_num | 988733075 |
| open_access_boolean | |
| owner | DE-92 |
| owner_facet | DE-92 |
| physical | 1 online resource (xiv, 203 p.) ill |
| psigel | ZDB-124-WOP ZDB-124-WOP FHN_PDA_WOP |
| publishDate | 2016 |
| publishDateSearch | 2016 |
| publishDateSort | 2016 |
| publisher | World Scientific Publishing Co. Pte. Ltd. |
| record_format | marc |
| spelling | Diaby, Moustapha Verfasser aut Advances in combinatorial optimization linear programming formulations of the traveling salesman and other hard combinatorial optimization problems Moustapha Diaby, Mark H. Karwan Singapore World Scientific Publishing Co. Pte. Ltd. © 2016 1 online resource (xiv, 203 p.) ill txt rdacontent c rdamedia cr rdacarrier Title from PDF file title page (viewed February 13, 2016) "Combinational optimization (CO) is a topic in applied mathematics, decision science and computer science that consists of finding the best solution from a non-exhaustive search. CO is related to disciplines such as computational complexity theory and algorithm theory, and has important applications in fields such as operations research/management science, artificial intelligence, machine learning, and software engineering. Advances in Combinatorial Optimization presents a generalized framework for formulating hard combinatorial optimization problems (COPs) as polynomial sized linear programs. Though developed based on the 'traveling salesman problem' (TSP), the framework allows for the formulating of many of the well-known NP-Complete COPs directly (without the need to reduce them to other COPs) as linear programs, and demonstrates the same for three other problems (e.g. the 'vertex coloring problem' (VCP)). This work also represents a proof of the equality of the complexity classes "P" (polynomial time) and "NP" (nondeterministic polynomial time), and makes a contribution to the theory and application of 'extended formulations' (EFs). On a whole, Advances in Combinatorial Optimization offers new modeling and solution perspectives which will be useful to professionals, graduate students and researchers who are either involved in routing, scheduling and sequencing decision-making in particular, or in dealing with the theory of computing in general."-- Combinatorial optimization Mathematical optimization Optimierungsproblem (DE-588)4390818-4 gnd rswk-swf Optimierungsproblem (DE-588)4390818-4 s 1\p DE-604 Karwan, Mark H. 1951- Sonstige oth http://www.worldscientific.com/worldscibooks/10.1142/9725#t=toc Verlag URL des Erstveroeffentlichers Volltext 1\p cgwrk 20201028 DE-101 https://d-nb.info/provenance/plan#cgwrk |
| spellingShingle | Diaby, Moustapha Advances in combinatorial optimization linear programming formulations of the traveling salesman and other hard combinatorial optimization problems Combinatorial optimization Mathematical optimization Optimierungsproblem (DE-588)4390818-4 gnd |
| subject_GND | (DE-588)4390818-4 |
| title | Advances in combinatorial optimization linear programming formulations of the traveling salesman and other hard combinatorial optimization problems |
| title_auth | Advances in combinatorial optimization linear programming formulations of the traveling salesman and other hard combinatorial optimization problems |
| title_exact_search | Advances in combinatorial optimization linear programming formulations of the traveling salesman and other hard combinatorial optimization problems |
| title_full | Advances in combinatorial optimization linear programming formulations of the traveling salesman and other hard combinatorial optimization problems Moustapha Diaby, Mark H. Karwan |
| title_fullStr | Advances in combinatorial optimization linear programming formulations of the traveling salesman and other hard combinatorial optimization problems Moustapha Diaby, Mark H. Karwan |
| title_full_unstemmed | Advances in combinatorial optimization linear programming formulations of the traveling salesman and other hard combinatorial optimization problems Moustapha Diaby, Mark H. Karwan |
| title_short | Advances in combinatorial optimization |
| title_sort | advances in combinatorial optimization linear programming formulations of the traveling salesman and other hard combinatorial optimization problems |
| title_sub | linear programming formulations of the traveling salesman and other hard combinatorial optimization problems |
| topic | Combinatorial optimization Mathematical optimization Optimierungsproblem (DE-588)4390818-4 gnd |
| topic_facet | Combinatorial optimization Mathematical optimization Optimierungsproblem |
| url | http://www.worldscientific.com/worldscibooks/10.1142/9725#t=toc |
| work_keys_str_mv | AT diabymoustapha advancesincombinatorialoptimizationlinearprogrammingformulationsofthetravelingsalesmanandotherhardcombinatorialoptimizationproblems AT karwanmarkh advancesincombinatorialoptimizationlinearprogrammingformulationsofthetravelingsalesmanandotherhardcombinatorialoptimizationproblems |