Op werkdagen voor 23:00 besteld, morgen in huis Gratis verzending vanaf €20

Paradigms of Combinatorial Optimization – Problems and New Approaches 2e

Problems and New Approaches

Gebonden Engels 2014 9781848216570
Verwachte levertijd ongeveer 9 werkdagen

Samenvatting

Combinatorial 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.

Concepts of Combinatorial Optimization, is divided into three parts:
– On the complexity of combinatorial optimization problems, presenting basics about worst–case and randomized complexity;
– Classical solution methods, presenting the two most–known methods for solving hard combinatorial optimization problems, that are Branch–and–Bound and Dynamic Programming;
– 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.

Specificaties

ISBN13:9781848216570
Taal:Engels
Bindwijze:gebonden
Aantal pagina's:720
Hoofdrubriek:
Serie:ISTE

Lezersrecensies

Wees de eerste die een lezersrecensie schrijft!

Inhoudsopgave

Preface xvii
<p>Vangelis Th. Paschos</p>
<p>Part I Paradigmatic Problems 1</p>
<p>Chapter 1 Optimal Satisfiability 3<br /> Cristina Bazgan</p>
<p>Chapter 2 Scheduling Problems 33<br /> Philippe Chr&eacute;tienne and Christophe Picouleau</p>
<p>Chapter 3 Location Problems 61<br /> Aristotelis Giannakos</p>
<p>Chapter 4 MiniMax Algorithms and Games 89<br /> Michel Koskas</p>
<p>Chapter 5 Two–dimensional Bin Packing Problems 107<br /> Andrea Lodi, Silvano Martello, Michele Monaci and Daniele Vigo</p>
<p>Chapter 6 The Maximum Cut Problem 131<br /> Walid Ben–Ameur, Ali Ridha Mahjoub and Jos&eacute; Neto</p>
<p>Chapter 7 The Traveling Salesman Problem and its Variations 173<br /> J&eacute;r&ocirc;me Monnot and Sophie Toulouse</p>
<p>Chapter 8 0–1 Knapsack Problems 215<br /> Gerard Plateau and Anass Nagih</p>
<p>Chapter 9 Integer Quadratic Knapsack Problems 243<br /> Dominique Quadri, Eric Soutif and Pierre Tolla</p>
<p>Chapter 10 Graph Coloring Problems 265<br /> Dominique De Werra and Daniel Kobler</p>
<p>Part II New Approaches 311</p>
<p>Chapter 11 Polynomial Approximation 313<br /> Marc Demange and Vangelis Th. Paschos</p>
<p>Chapter 12 Approximation Preserving Reductions 351<br /> Giorgio Ausiello and Vangelis Th. Paschos</p>
<p>Chapter 13 Inapproximability of Combinatorial Optimization Problems 381<br /> Luca Trevisan</p>
<p>Chapter 14 Local Search: Complexity and Approximation 435<br /> Eric Angel, Petros Christopoulos and Vassilis Zissimopoulos</p>
<p>Chapter 15 On–line Algorithms 473<br /> Giorgio Ausiello and Luca Becchetti</p>
<p>Chapter 16 Polynomial Approximation for Multicriteria Combinatorial Optimization Problems 511<br /> Eric Angel, Evripidis Bampis and Laurent Gourves</p>
<p>Chapter 17 An Introduction to Inverse Combinatorial Problems 547<br /> Marc Demange and J&eacute;r&ocirc;me Monnot</p>
<p>Chapter 18 Probabilistic Combinatorial Optimization 587<br /> Cecile Murat and Vangelis Th. Paschos</p>
<p>Chapter 19 Robust Shortest Path Problems&nbsp; 615<br /> Virginie Gabrel and C&eacute;cile Murat</p>
<p>Chapter 20 Algorithmic Games 641<br /> Aristotelis Giannakos and Bangelis Paschos</p>
<p>Chapter 21 Combinatorial Optimization with Competing Agents 675<br /> Diodato Ferraioli, Laurent Gourv&egrave;s, Stefano Moretti, Fanny Pascual and Olivier Spanjaard</p>
<p>General Bibliography 707</p>
<p>List of Authors 767</p>
<p>Index 773</p>
<p>Summary of Other Volumes in the Series 781</p>

Managementboek Top 100

Rubrieken

Populaire producten

    Personen

      Trefwoorden

        Paradigms of Combinatorial Optimization – Problems and New Approaches 2e