Paradigms of combinatorial optimization /
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 to...
| Other Authors: | |
|---|---|
| Format: | eBook |
| Language: | English |
| Published: |
London :
ISTE, Ltd. ;
2014.
Hoboken : Wiley, 2014. |
| Edition: | 2nd ed. |
| Series: | ISTE.
|
| Subjects: | |
| Online Access: | Full Text via HEAL-Link |
| LEADER | 05847nam a2200697 4500 | ||
|---|---|---|---|
| 001 | ocn887507243 | ||
| 003 | OCoLC | ||
| 005 | 20170124070751.3 | ||
| 006 | m o d | ||
| 007 | cr cnu---unuuu | ||
| 008 | 140816s2014 enk ob 001 0 eng d | ||
| 040 | |a EBLCP |b eng |e pn |c EBLCP |d DG1 |d N$T |d OCLCQ |d OCLCO |d OCLCF |d DEBSZ |d DEBBG |d OCLCQ |d GrThAP | ||
| 020 | |a 9781119005353 |q (electronic bk.) | ||
| 020 | |a 1119005353 |q (electronic bk.) | ||
| 020 | |a 9781119015161 |q (electronic bk.) | ||
| 020 | |a 1119015162 |q (electronic bk.) | ||
| 029 | 1 | |a CHBIS |b 010259772 | |
| 029 | 1 | |a CHDSB |b 006318347 | |
| 029 | 1 | |a CHVBK |b 325939551 | |
| 029 | 1 | |a CHVBK |b 326773193 | |
| 029 | 1 | |a DEBBG |b BV043397059 | |
| 029 | 1 | |a DEBSZ |b 43174615X | |
| 035 | |a (OCoLC)887507243 | ||
| 050 | 4 | |a QA402.5 |b .P384 2014 | |
| 072 | 7 | |a MAT |x 003000 |2 bisacsh | |
| 072 | 7 | |a MAT |x 029000 |2 bisacsh | |
| 082 | 0 | 4 | |a 519.703 |
| 049 | |a MAIN | ||
| 245 | 0 | 0 | |a Paradigms of combinatorial optimization / |c edited by Vangelis Th. Paschos. |
| 250 | |a 2nd ed. | ||
| 264 | 1 | |a London : |b ISTE, Ltd. ; |c 2014. | |
| 264 | 1 | |a Hoboken : |b Wiley, |c 2014. | |
| 300 | |a 1 online resource (815 pages). | ||
| 336 | |a text |b txt |2 rdacontent | ||
| 337 | |a computer |b c |2 rdamedia | ||
| 338 | |a online resource |b cr |2 rdacarrier | ||
| 490 | 1 | |a ISTE | |
| 588 | 0 | |a Print version record. | |
| 505 | 8 | |a 4.2. Games of no chance: the simple cases4.3. The case of complex no chance games; 4.3.1. Approximative evaluation; 4.3.2. Horizon effect; 4.3.3. [alpha]-[beta] pruning; 4.4. Quiescence search; 4.4.1. Other refinements of the MiniMax algorithm; 4.5. Case of games using chance; 4.6. Conclusion; 4.7. Bibliography; Chapter 5: Two-dimensional Bin Packing Problems; 5.1. Introduction; 5.2. Models; 5.2.1. ILP models for level packing; 5.3. Upper bounds; 5.3.1. Strip packing; 5.3.2. Bin packing: two-phase heuristics; 5.3.3. Bin packing: one-phase level heuristics. | |
| 505 | 0 | |a Cover; Title Page; Copyright; Contents; Preface; PART I: Paradigmatic Problems; Chapter 1: Optimal Satisfiability; 1.1. Introduction; 1.2. Preliminaries; 1.2.1. Constraint satisfaction problems: decision and optimization versions; 1.2.2. Constraint types; 1.3. Complexity of decision problems; 1.4. Complexity and approximation of optimization problems; 1.4.1. Maximization problems; 1.4.2. Minimization problems; 1.5. Particular instances of constraint satisfaction problems; 1.5.1. Planar instances; 1.5.2. Dense instances; 1.5.3. Instances with a bounded number of occurrences. | |
| 505 | 8 | |a 1.6. Satisfiability problems under global constraints1.7. Conclusion; 1.8. Bibliography; Chapter 2: Scheduling Problems; 2.1. Introduction; 2.2. New techniques for approximation; 2.2.1. Linear programming and scheduling; 2.2.1.1. Single machine problems; 2.2.1.2. Problems with m machines; 2.2.2. An approximation scheme for PCmax; 2.3. Constraints and scheduling; 2.3.1. The monomachine constraint; 2.3.2. The cumulative constraint; 2.3.3. Energetic reasoning; 2.4. Non-regular criteria; 2.4.1. PERT with convex costs; 2.4.1.1. The equality graph and its blocks; 2.4.1.2. Generic algorithm. | |
| 505 | 8 | |a 2.4.1.3. Complexity of the generic algorithm2.4.2. Minimizing the early-tardy cost on one machine; 2.4.2.1. Special cases; 2.4.2.2. The lower bound; 2.4.2.3. The branch-and-bound algorithm; 2.4.2.4. Lower bounds in a node of the search tree; 2.4.2.5. Upper bound; 2.4.2.6. Branching rule; 2.4.2.7. Dominance rules; 2.4.2.8. Experimental results; 2.5. Bibliography; Chapter 3: Location Problems; 3.1. Introduction; 3.1.1. Weber's problem; 3.1.2. A classification; 3.2. Continuous problems; 3.2.1. Complete covering; 3.2.2. Maximal covering; 3.2.2.1. Fixed radius; 3.2.2.2. Variable radius. | |
| 505 | 8 | |a 3.2.3. Empty covering3.2.4. Bicriteria models; 3.2.5. Covering with multiple resources; 3.3. Discrete problems; 3.3.1. p-Center; 3.3.2. p-Dispersion; 3.3.3. p-Median; 3.3.3.1. Fixed charge; 3.3.4. Hub; 3.3.5. p-Maxisum; 3.4. On-line problems; 3.5. The quadratic assignment problem; 3.5.1. Definitions and formulations of the problem; 3.5.2. Complexity; 3.5.3. Relaxations and lower bounds; 3.5.3.1. Linear relaxations; 3.5.3.2. Semi-definite relaxations; 3.5.3.3. Convex quadratic relaxations; 3.6. Conclusion; 3.7. Bibliography; Chapter 4: MiniMax Algorithms and Games; 4.1. Introduction. | |
| 500 | |a 5.3.4. Bin packing: one-phase non-level heuristics. | ||
| 520 | |a 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. | ||
| 504 | |a Includes bibliographical references and index. | ||
| 650 | 0 | |a Combinatorial optimization. | |
| 650 | 0 | |a Programming (Mathematics) | |
| 650 | 4 | |a Combinatorial optimization. | |
| 650 | 4 | |a Game theory. | |
| 650 | 4 | |a Mathematics. | |
| 650 | 7 | |a MATHEMATICS |x Applied. |2 bisacsh | |
| 650 | 7 | |a MATHEMATICS |x Probability & Statistics |x General. |2 bisacsh | |
| 650 | 7 | |a Combinatorial optimization. |2 fast |0 (OCoLC)fst00868980 | |
| 650 | 7 | |a Programming (Mathematics) |2 fast |0 (OCoLC)fst01078701 | |
| 655 | 4 | |a Electronic books. | |
| 700 | 1 | |a Paschos, Vangelis Th. | |
| 776 | 0 | 8 | |i Print version: |a Paschos, Vangelis Th. |t Paradigms of Combinatorial Optimization-2nd Edition: Problems and New Approaches. |d Hoboken : Wiley, ©2014 |z 9781848216570 |
| 830 | 0 | |a ISTE. | |
| 856 | 4 | 0 | |u https://doi.org/10.1002/9781119005353 |z Full Text via HEAL-Link |
| 994 | |a 92 |b DG1 | ||
