{"product_id":"paradigms-of-combinatorial-optimization-problems-and-new-approaches-hardback-9781848216570","title":"Paradigms of Combinatorial Optimization; Problems and New Approaches (Hardback) 9781848216570","description":"\u003cfont face=\"Georgia\"\u003e\r\n\u003cp\u003e\u003cfont size=\"6\"\u003eParadigms of Combinatorial Optimization\u003c\/font\u003e\u003cbr\u003e\r\n\u003cfont size=\"5\"\u003eProblems and New Approaches\u003c\/font\u003e\u003c\/p\u003e\r\n\r\n\r\n\r\n\r\n\u003cp\u003e\u003cfont size=\"4\"\u003eVangelis Th. Paschos (Edited by), VT Paschos (Author)\u003c\/font\u003e\u003c\/p\u003e\r\n\r\n\u003cp\u003e\u003cfont size=\"3\"\u003e9781848216570, Wiley\u003c\/font\u003e\u003c\/p\u003e\r\n\r\n\u003cp\u003e\u003cfont size=\"3\"\u003eHardback, published 29 July 2014\u003c\/font\u003e\u003c\/p\u003e\r\n\r\n\u003cp\u003e\u003cfont size=\"3\"\u003e816 pages\u003cbr\u003e24.1 x 16.5 x 5.1 cm, 1.343 kg\u003c\/font\u003e\u003c\/p\u003e\r\n\r\n\r\n\r\n\r\n\r\n\u003cp align=\"justify\"\u003e\u003cstrong\u003e\u003cfont size=\"3\"\u003e\u003cp\u003eCombinatorial optimization is a multidisciplinary scientific area, lying in the interface of three major scientific domains: mathematics, theoretical computer science and management.  The three volumes of the Combinatorial Optimization series aim to cover a wide range  of topics in this area. These topics also deal with fundamental notions and approaches as with several classical applications of combinatorial optimization.\u003cbr\u003e \u003cbr\u003e \u003ci\u003eConcepts of Combinatorial Optimization\u003c\/i\u003e, is divided into three parts:\u003cbr\u003e - On the complexity of combinatorial optimization problems, presenting basics about worst-case and randomized complexity;\u003cbr\u003e - Classical solution methods, presenting the two most-known methods for solving hard combinatorial optimization problems, that are Branch-and-Bound and Dynamic Programming;\u003cbr\u003e - Elements from mathematical programming, presenting fundamentals from mathematical programming based methods that are in the heart of Operations Research since the origins of this field.\u003c\/p\u003e\u003c\/font\u003e\u003c\/strong\u003e\u003c\/p\u003e\r\n\r\n\u003cp\u003e\u003cfont size=\"3\"\u003ePreface xvii  \u003cp\u003eVangelis Th. Paschos\u003c\/p\u003e \u003cp\u003e\u003cb\u003ePart I Paradigmatic Problems 1\u003c\/b\u003e\u003c\/p\u003e \u003cp\u003eChapter 1 Optimal Satisfiability 3\u003cbr\u003e \u003ci\u003eCristina Bazgan\u003c\/i\u003e\u003c\/p\u003e \u003cp\u003eChapter 2 Scheduling Problems 33\u003cbr\u003e \u003ci\u003ePhilippe Chrétienne and Christophe Picouleau\u003c\/i\u003e\u003c\/p\u003e \u003cp\u003eChapter 3 Location Problems 61\u003cbr\u003e \u003ci\u003eAristotelis Giannakos\u003c\/i\u003e\u003c\/p\u003e \u003cp\u003eChapter 4 MiniMax Algorithms and Games 89\u003cbr\u003e \u003ci\u003eMichel Koskas\u003c\/i\u003e\u003c\/p\u003e \u003cp\u003eChapter 5 Two-dimensional Bin Packing Problems 107\u003cbr\u003e \u003ci\u003eAndrea Lodi, Silvano Martello, Michele Monaci and Daniele Vigo\u003c\/i\u003e\u003c\/p\u003e \u003cp\u003eChapter 6 The Maximum Cut Problem 131\u003cbr\u003e \u003ci\u003eWalid Ben-Ameur, Ali Ridha Mahjoub and José Neto\u003c\/i\u003e\u003c\/p\u003e \u003cp\u003eChapter 7 The Traveling Salesman Problem and its Variations 173\u003cbr\u003e \u003ci\u003eJérôme Monnot and Sophie Toulouse\u003c\/i\u003e\u003c\/p\u003e \u003cp\u003eChapter 8 0-1 Knapsack Problems 215\u003cbr\u003e \u003ci\u003eGerard Plateau and Anass Nagih\u003c\/i\u003e\u003c\/p\u003e \u003cp\u003eChapter 9 Integer Quadratic Knapsack Problems 243\u003cbr\u003e \u003ci\u003eDominique Quadri, Eric Soutif and Pierre Tolla\u003c\/i\u003e\u003c\/p\u003e \u003cp\u003eChapter 10 Graph Coloring Problems 265\u003cbr\u003e \u003ci\u003eDominique De Werra and Daniel Kobler\u003c\/i\u003e\u003c\/p\u003e \u003cp\u003e\u003cb\u003ePart II New Approaches 311\u003c\/b\u003e\u003c\/p\u003e \u003cp\u003eChapter 11 Polynomial Approximation 313\u003cbr\u003e \u003ci\u003eMarc Demange and Vangelis Th. Paschos\u003c\/i\u003e\u003c\/p\u003e \u003cp\u003eChapter 12 Approximation Preserving Reductions 351\u003cbr\u003e \u003ci\u003eGiorgio Ausiello and Vangelis Th. Paschos\u003c\/i\u003e\u003c\/p\u003e \u003cp\u003eChapter 13 Inapproximability of Combinatorial Optimization Problems 381\u003cbr\u003e \u003ci\u003eLuca Trevisan\u003c\/i\u003e\u003c\/p\u003e \u003cp\u003eChapter 14 Local Search: Complexity and Approximation 435\u003cbr\u003e \u003ci\u003eEric Angel, Petros Christopoulos and Vassilis Zissimopoulos\u003c\/i\u003e\u003c\/p\u003e \u003cp\u003eChapter 15 On-line Algorithms 473\u003cbr\u003e \u003ci\u003eGiorgio Ausiello and Luca Becchetti\u003c\/i\u003e\u003c\/p\u003e \u003cp\u003eChapter 16 Polynomial Approximation for Multicriteria Combinatorial Optimization Problems 511\u003cbr\u003e \u003ci\u003eEric Angel, Evripidis Bampis and Laurent Gourves\u003c\/i\u003e\u003c\/p\u003e \u003cp\u003eChapter 17 An Introduction to Inverse Combinatorial Problems 547\u003cbr\u003e \u003ci\u003eMarc Demange and Jérôme Monnot\u003c\/i\u003e\u003c\/p\u003e \u003cp\u003eChapter 18 Probabilistic Combinatorial Optimization 587\u003cbr\u003e \u003ci\u003eCecile Murat and Vangelis Th. Paschos\u003c\/i\u003e\u003c\/p\u003e \u003cp\u003eChapter 19 Robust Shortest Path Problems  615\u003cbr\u003e \u003ci\u003eVirginie Gabrel and Cécile Murat\u003c\/i\u003e\u003c\/p\u003e \u003cp\u003eChapter 20 Algorithmic Games 641\u003cbr\u003e \u003ci\u003eAristotelis Giannakos and Bangelis Paschos\u003c\/i\u003e\u003c\/p\u003e \u003cp\u003eChapter 21 Combinatorial Optimization with Competing Agents 675\u003cbr\u003e \u003ci\u003eDiodato Ferraioli, Laurent Gourvès, Stefano Moretti, Fanny Pascual and Olivier Spanjaard\u003c\/i\u003e\u003c\/p\u003e \u003cp\u003eGeneral Bibliography 707\u003c\/p\u003e \u003cp\u003eList of Authors 767\u003c\/p\u003e \u003cp\u003eIndex 773\u003c\/p\u003e \u003cp\u003eSummary of Other Volumes in the Series 781\u003c\/p\u003e\u003c\/font\u003e\u003c\/p\u003e\r\n\r\n\u003cp\u003e\u003cfont size=\"3\"\u003eSubject Areas: Mathematics [\u003ca title=\"See our other books on Mathematics\" href=\"https:\/\/freshlyprintedbooks.co.uk\/search?q=%22Mathematics%20%5BPB%5D%22\"\u003ePB\u003c\/a\u003e]\u003c\/font\u003e\u003c\/p\u003e\r\n\r\n\r\n\u003c\/font\u003e","brand":"Wiley-ISTE","offers":[{"title":"Brand New","offer_id":52449386987800,"sku":"9781848216570","price":185.89,"currency_code":"GBP","in_stock":true}],"thumbnail_url":"\/\/cdn.shopify.com\/s\/files\/1\/0730\/2037\/5320\/files\/9781848216570.jpg?v=1785197646","url":"https:\/\/freshlyprintedbooks.co.uk\/products\/paradigms-of-combinatorial-optimization-problems-and-new-approaches-hardback-9781848216570","provider":"Freshly Printed Books","version":"1.0","type":"link"}