Info
- Utilizzare la checkbox di selezione a fianco di ciascun documento per attivare le funzionalità di stampa, invio email, download nei formati disponibili del (i) record.
Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems [[electronic resource] ] : 7th International Conference, CPAIOR 2010, Bologna, Italy, June 14-18, 2010, Proceedings / / edited by Andrea Lodi, Michela Milano, Paolo Toth
| Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems [[electronic resource] ] : 7th International Conference, CPAIOR 2010, Bologna, Italy, June 14-18, 2010, Proceedings / / edited by Andrea Lodi, Michela Milano, Paolo Toth |
| Edizione | [1st ed. 2010.] |
| Pubbl/distr/stampa | Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2010 |
| Descrizione fisica | 1 online resource (XI, 369 p. 70 illus.) |
| Disciplina | 519.64 |
| Collana | Theoretical Computer Science and General Issues |
| Soggetto topico |
Artificial intelligence
Discrete mathematics Computer science Numerical analysis Computer science—Mathematics Algorithms Artificial Intelligence Discrete Mathematics Theory of Computation Numerical Analysis Discrete Mathematics in Computer Science |
| ISBN |
1-280-38701-7
9786613564931 3-642-13520-X |
| Formato | Materiale a stampa  |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Nota di contenuto | Towards a MIP-Cut Metascheme -- Challenges for CPAIOR in Computational Sustainability -- Lazy Clause Generation: Combining the Power of SAT and CP (and MIP?) Solving -- On Matrices, Automata, and Double Counting -- The Increasing Nvalue Constraint -- Improving the Held and Karp Approach with Constraint Programming -- Characterization and Automation of Matching-Based Neighborhoods -- Rapid Learning for Binary Programs -- Hybrid Methods for the Multileaf Collimator Sequencing Problem -- Automatically Exploiting Subproblem Equivalence in Constraint Programming -- Single-Facility Scheduling over Long Time Horizons by Logic-Based Benders Decomposition -- Integrated Maintenance Scheduling for Semiconductor Manufacturing -- A Constraint Programming Approach for the Service Consolidation Problem -- Solving Connected Subgraph Problems in Wildlife Conservation -- Consistency Check for the Bin Packing Constraint Revisited -- A Relax-and-Cut Framework for Gomory’s Mixed-Integer Cuts -- An In-Out Approach to Disjunctive Optimization -- A SAT Encoding for Multi-dimensional Packing Problems -- Job Shop Scheduling with Setup Times and Maximal Time-Lags: A Simple Constraint Programming Approach -- On the Design of the Next Generation Access Networks -- Vehicle Routing for Food Rescue Programs: A Comparison of Different Approaches -- Constraint Programming and Combinatorial Optimisation in Numberjack -- Automated Configuration of Mixed Integer Programming Solvers -- Upper Bounds on the Number of Solutions of Binary Integer Programs -- Matrix Interdiction Problem -- Strong Combination of Ant Colony Optimization with Constraint Programming Optimization -- Service-Oriented Volunteer Computing for Massively Parallel Constraint Solving Using Portfolios -- Constraint Programming with Arbitrarily Large Integer Variables -- Constraint-Based Local Search for Constrained Optimum Paths Problems -- Stochastic Constraint Programming by Neuroevolution with Filtering -- The Weighted Spanning Tree Constraint Revisited -- Constraint Reasoning with Uncertain Data Using CDF-Intervals -- Revisiting the Soft Global Cardinality Constraint -- A Constraint Integer Programming Approach for Resource-Constrained Project Scheduling -- Strategic Planning for Disaster Recovery with Stochastic Last Mile Distribution -- Massively Parallel Constraint Programming for Supercomputers: Challenges and Initial Results -- Boosting Set Constraint Propagation for Network Design -- More Robust Counting-Based Search Heuristics with Alldifferent Constraints. |
| Record Nr. | UNISA-996465610403316 |
| Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2010 | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. di Salerno | ||
| ||
Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems : 7th International Conference, CPAIOR 2010, Bologna, Italy, June 14-18, 2010, Proceedings / / edited by Andrea Lodi, Michela Milano, Paolo Toth
| Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems : 7th International Conference, CPAIOR 2010, Bologna, Italy, June 14-18, 2010, Proceedings / / edited by Andrea Lodi, Michela Milano, Paolo Toth |
| Edizione | [1st ed. 2010.] |
| Pubbl/distr/stampa | Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2010 |
| Descrizione fisica | 1 online resource (XI, 369 p. 70 illus.) |
| Disciplina | 519.64 |
| Collana | Theoretical Computer Science and General Issues |
| Soggetto topico |
Artificial intelligence
Discrete mathematics Computer science Numerical analysis Computer science—Mathematics Algorithms Artificial Intelligence Discrete Mathematics Theory of Computation Numerical Analysis Discrete Mathematics in Computer Science |
| ISBN |
1-280-38701-7
9786613564931 3-642-13520-X |
| Formato | Materiale a stampa |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Nota di contenuto | Towards a MIP-Cut Metascheme -- Challenges for CPAIOR in Computational Sustainability -- Lazy Clause Generation: Combining the Power of SAT and CP (and MIP?) Solving -- On Matrices, Automata, and Double Counting -- The Increasing Nvalue Constraint -- Improving the Held and Karp Approach with Constraint Programming -- Characterization and Automation of Matching-Based Neighborhoods -- Rapid Learning for Binary Programs -- Hybrid Methods for the Multileaf Collimator Sequencing Problem -- Automatically Exploiting Subproblem Equivalence in Constraint Programming -- Single-Facility Scheduling over Long Time Horizons by Logic-Based Benders Decomposition -- Integrated Maintenance Scheduling for Semiconductor Manufacturing -- A Constraint Programming Approach for the Service Consolidation Problem -- Solving Connected Subgraph Problems in Wildlife Conservation -- Consistency Check for the Bin Packing Constraint Revisited -- A Relax-and-Cut Framework for Gomory’s Mixed-Integer Cuts -- An In-Out Approach to Disjunctive Optimization -- A SAT Encoding for Multi-dimensional Packing Problems -- Job Shop Scheduling with Setup Times and Maximal Time-Lags: A Simple Constraint Programming Approach -- On the Design of the Next Generation Access Networks -- Vehicle Routing for Food Rescue Programs: A Comparison of Different Approaches -- Constraint Programming and Combinatorial Optimisation in Numberjack -- Automated Configuration of Mixed Integer Programming Solvers -- Upper Bounds on the Number of Solutions of Binary Integer Programs -- Matrix Interdiction Problem -- Strong Combination of Ant Colony Optimization with Constraint Programming Optimization -- Service-Oriented Volunteer Computing for Massively Parallel Constraint Solving Using Portfolios -- Constraint Programming with Arbitrarily Large Integer Variables -- Constraint-Based Local Search for Constrained Optimum Paths Problems -- Stochastic Constraint Programming by Neuroevolution with Filtering -- The Weighted Spanning Tree Constraint Revisited -- Constraint Reasoning with Uncertain Data Using CDF-Intervals -- Revisiting the Soft Global Cardinality Constraint -- A Constraint Integer Programming Approach for Resource-Constrained Project Scheduling -- Strategic Planning for Disaster Recovery with Stochastic Last Mile Distribution -- Massively Parallel Constraint Programming for Supercomputers: Challenges and Initial Results -- Boosting Set Constraint Propagation for Network Design -- More Robust Counting-Based Search Heuristics with Alldifferent Constraints. |
| Record Nr. | UNINA-9910484528903321 |
| Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2010 | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. Federico II | ||
| ||
Introduction to Combinatorial Optimization [[electronic resource] /] / by Ding-Zhu Du, Panos M. Pardalos, Xiaodong Hu, Weili Wu
| Introduction to Combinatorial Optimization [[electronic resource] /] / by Ding-Zhu Du, Panos M. Pardalos, Xiaodong Hu, Weili Wu |
| Autore | Du Dingzhu |
| Edizione | [1st ed. 2022.] |
| Pubbl/distr/stampa | Cham : , : Springer International Publishing : , : Imprint : Springer, , 2022 |
| Descrizione fisica | 1 online resource (407 pages) |
| Disciplina | 519.64 |
| Collana | Springer Optimization and Its Applications |
| Soggetto topico |
Mathematical optimization
Computer science Operations research Management science Algorithms Optimization Theory of Computation Operations Research, Management Science Optimització combinatòria |
| Soggetto genere / forma | Llibres electrònics |
| ISBN | 3-031-10596-6 |
| Formato | Materiale a stampa |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Nota di contenuto | 1. Introduction.-2. Divide-and-Conquer -- 3. Dynamic Programming and Shortest Path -- 4. Greedy Algorithm and Spanning Tree -- 5. Incremental Method and Maximum Network Flow -- 6. Linear Programming -- 7. Primal-Dual Methods and Minimum Cost Flow -- 8. NP-hard Problems and Approximation Algorithms -- 9. Restriction and Steiner Tree -- 10. Greedy Approximation and Submodular Optimization -- 11. Relaxation and Rounding. 12. Nonsubmodular Optimization -- Bibliography. |
| Record Nr. | UNISA-996490345703316 |
Du Dingzhu
|
||
| Cham : , : Springer International Publishing : , : Imprint : Springer, , 2022 | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. di Salerno | ||
| ||
Introduction to Combinatorial Optimization / / by Ding-Zhu Du, Panos M. Pardalos, Xiaodong Hu, Weili Wu
| Introduction to Combinatorial Optimization / / by Ding-Zhu Du, Panos M. Pardalos, Xiaodong Hu, Weili Wu |
| Autore | Du Dingzhu |
| Edizione | [1st ed. 2022.] |
| Pubbl/distr/stampa | Cham : , : Springer International Publishing : , : Imprint : Springer, , 2022 |
| Descrizione fisica | 1 online resource (407 pages) |
| Disciplina | 519.64 |
| Collana | Springer Optimization and Its Applications |
| Soggetto topico |
Mathematical optimization
Computer science Operations research Management science Algorithms Optimization Theory of Computation Operations Research, Management Science Optimització combinatòria |
| Soggetto genere / forma | Llibres electrònics |
| ISBN | 3-031-10596-6 |
| Formato | Materiale a stampa |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Nota di contenuto | 1. Introduction.-2. Divide-and-Conquer -- 3. Dynamic Programming and Shortest Path -- 4. Greedy Algorithm and Spanning Tree -- 5. Incremental Method and Maximum Network Flow -- 6. Linear Programming -- 7. Primal-Dual Methods and Minimum Cost Flow -- 8. NP-hard Problems and Approximation Algorithms -- 9. Restriction and Steiner Tree -- 10. Greedy Approximation and Submodular Optimization -- 11. Relaxation and Rounding. 12. Nonsubmodular Optimization -- Bibliography. |
| Record Nr. | UNINA-9910616395903321 |
|
Du Dingzhu
|
||
| Cham : , : Springer International Publishing : , : Imprint : Springer, , 2022 | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. Federico II | ||
| ||
Mathematical Tapas [[electronic resource] ] : Volume 2 (From Undergraduate to Graduate Level) / / by Jean-Baptiste Hiriart-Urruty
| Mathematical Tapas [[electronic resource] ] : Volume 2 (From Undergraduate to Graduate Level) / / by Jean-Baptiste Hiriart-Urruty |
| Autore | Hiriart-Urruty Jean-Baptiste |
| Edizione | [1st ed. 2017.] |
| Pubbl/distr/stampa | Cham : , : Springer International Publishing : , : Imprint : Springer, , 2017 |
| Descrizione fisica | 1 online resource (XII, 255 p. 10 illus., 5 illus. in color.) |
| Disciplina | 519.64 |
| Collana | Springer Undergraduate Mathematics Series |
| Soggetto topico |
Mathematics
Mathematics, general |
| ISBN | 3-319-68631-3 |
| Formato | Materiale a stampa |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Nota di contenuto | Part I. One-starred tapas -- Part II. two-starred tapas -- Part III. Three-starred tapas -- Part IV. Open problems. |
| Record Nr. | UNINA-9910254311603321 |
|
Hiriart-Urruty Jean-Baptiste
|
||
| Cham : , : Springer International Publishing : , : Imprint : Springer, , 2017 | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. Federico II | ||
| ||
Mathematical Tapas : Volume 1 (for Undergraduates) / / by Jean-Baptiste Hiriart-Urruty
| Mathematical Tapas : Volume 1 (for Undergraduates) / / by Jean-Baptiste Hiriart-Urruty |
| Autore | Hiriart-Urruty Jean-Baptiste |
| Edizione | [1st ed. 2016.] |
| Pubbl/distr/stampa | Cham : , : Springer International Publishing : , : Imprint : Springer, , 2016 |
| Descrizione fisica | 1 online resource (X, 159 p.) |
| Disciplina | 519.64 |
| Collana | Springer Undergraduate Mathematics Series |
| Soggetto topico |
Matrix theory
Algebra Mathematical analysis Analysis (Mathematics) Mathematical optimization Linear and Multilinear Algebras, Matrix Theory Analysis Optimization |
| ISBN | 3-319-42186-7 |
| Formato | Materiale a stampa |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Nota di contenuto | Chapter 1 Proposals -- Chapter 2 Hint(s) -- Chapter 3 Answer(s), Comment(s). |
| Record Nr. | UNINA-9910254087903321 |
|
Hiriart-Urruty Jean-Baptiste
|
||
| Cham : , : Springer International Publishing : , : Imprint : Springer, , 2016 | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. Federico II | ||
| ||
Meta-heuristics : theory & applications / edited by Ibrahim H. Osman and James P. Kelly
| Meta-heuristics : theory & applications / edited by Ibrahim H. Osman and James P. Kelly |
| Pubbl/distr/stampa | Boston, : Kluwer Academic Publisher, ©1996 |
| Descrizione fisica | X, 690 p. ; 24 cm. |
| Disciplina |
519.6
519.64 |
| ISBN | 0792397002 |
| Formato | Materiale a stampa |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Record Nr. | UNISANNIO-UFI0233023 |
| Boston, : Kluwer Academic Publisher, ©1996 | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. del Sannio | ||
| ||
Modelli per l'ottimizzazione dell'instradamento dei veicoli in un caso reale. Tesi di laurea / laureando Mauro Portone ; relatore Chefi Triki
| Modelli per l'ottimizzazione dell'instradamento dei veicoli in un caso reale. Tesi di laurea / laureando Mauro Portone ; relatore Chefi Triki |
| Autore | Portone, Mauro |
| Pubbl/distr/stampa | Lecce : Università degli studi. Facoltà di Scienze MM.FF.NN. Corso di laurea triennale in Matematica applicata, a.a. 2003/2004 |
| Descrizione fisica | 29 p. : ill. ; 30 cm |
| Disciplina | 519.64 |
| Altri autori (Persone) | Triki, Chefi |
| Soggetto topico |
Vehicle routing problem
Combinatorial optimization |
| Classificazione |
LC TA342
AMS 90C |
| Formato | Materiale a stampa |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | ita |
| Record Nr. | UNISALENTO-991004281435907536 |
|
Portone, Mauro
|
||
| Lecce : Università degli studi. Facoltà di Scienze MM.FF.NN. Corso di laurea triennale in Matematica applicata, a.a. 2003/2004 | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. del Salento | ||
| ||
Ottimizzazione Combinatoria [[electronic resource] ] : Teoria e Algoritmi / / by Bernhard Korte, Jens Vygen
| Ottimizzazione Combinatoria [[electronic resource] ] : Teoria e Algoritmi / / by Bernhard Korte, Jens Vygen |
| Autore | Korte Bernhard |
| Edizione | [1st ed. 2011.] |
| Pubbl/distr/stampa | Milano : , : Springer Milan : , : Imprint : Springer, , 2011 |
| Descrizione fisica | 1 online resource (669 p.) |
| Disciplina | 519.64 |
| Collana | La Matematica per il 3+2 |
| Soggetto topico |
Combinatorics
Mathematical optimization Operations research Management science Mathematics Optimization Operations Research, Management Science Mathematics, general |
| ISBN | 88-470-1523-5 |
| Formato | Materiale a stampa |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | ita |
| Nota di contenuto |
Title Page; Copyright Page; Prefazione all'edizione italiana; Nota del traduttore; Prefazione alla Quarta Edizione; Prefazione alla Terza Edizione; Prefazione alla Seconda Edizione; Prefazione alla Prima Edizione; Table of Contents; 1 Introduzione; 1.1 Enumerazione; 1.2 Tempo di esecuzione degli algoritmi; 1.3 Problemi di ottimizzazione lineare; 1.4 Sorting; Esercizi; Riferimenti bibliografici; 2 Grafi; 2.1 Definizioni fondamentali; 2.2 Alberi, circuiti e tagli; 2.3 Connettivit`a; 2.4 Grafi di Eulero e grafi bipartiti; 2.5 Planarit`; 2.6 Dualit`a Planare; Esercizi; Riferimenti bibliografici
3 Programmazione lineare3.1 Poliedri; 3.2 Algoritmo del simplesso; 3.3 Implementazione dell'algoritmo del simplesso; 3.4 Dualit`a; Esercizi; Riferimenti bibliografici; 4 Algoritmi di programmazione lineare; 4.1 Dimensione dei vertici e delle facce; 4.2 Frazioni continue; 4.3 Eliminazione di Gauss; 4.4 Il metodo dell'Ellissoide; 4.5 Il Teorema di Khachiyan; 4.6 Separazione e ottimizzazione; Esercizi; Riferimenti bibliografici; 5 Programmazione intera; 5.1 Il guscio convesso di un poliedro; 5.2 Trasformazioni unimodulari; 5.3 Integralit`a totalmente duale; 5.4 Matrici totalmente unimodulari 5.5 Piani di taglio5.6 Rilassamento Lagrangiano; Esercizi; Riferimenti bibliografici; 6 Alberi di supporto e arborescenze; 6.1 Alberi di supporto di costo minimo; 6.2 Arborescenze di costo minimo; 6.3 Descrizioni poliedrali; 6.4 Packing di alberi di supporto e arborescenze; Esercizi; Riferimenti bibliografici; 7 Cammini minimi; 7.1 Cammini minimi da una singola sorgente; 7.2 Cammini minimi tra tutte le coppie di vertici; 7.3 Circuiti di peso medio minimo; Esercizi; Riferimenti bibliografici; 8 Reti di flusso; 8.1 Il Teorema del Massimo Flusso-Minimo Taglio; 8.2 Teorema di Menger 8.3 Algoritmo di Edmonds-Karp8.4 Flussi bloccanti e Algoritmo di Fujishige; 8.5 Algoritmo di Goldberg-Tarjan; 8.6 Alberi di Gomory-Hu; 8.7 Taglio di capacit`a minima in un grafo non orientato; Esercizi; Riferimenti bibliografici; 9 Flussi di costo minimo; 9.1 Formulazione del problema; 9.2 Un criterio di ottimalit`a; 9.3 Algoritmo di Cancellazione dei Cicli di Peso Medio Minimo; 9.4 Algoritmo di Ford-Fulkerson; 9.5 Algoritmo di Orlin; 9.6 Algoritmo del Simplesso per le Reti di Flusso; 9.7 Flussi Dinamici; Esercizi; Riferimenti bibliografici; 10 Matching Massimo; 10.1 Matching bipartito 10.2 La matrice di Tutte10.3 Il Teorema di Tutte; 10.4 Ear-Decomposition di Grafi Critici rispetto ai fattori; 10.5 Algoritmo di Matching di Edmonds; Esercizi; Riferimenti bibliografici; 11 Matching Pesato; 11.1 Il Problema di Assegnamento; 11.2 Schema dell'algoritmo di Matching di peso massimo; 11.3 Implementazione dell'algoritmo del Matching pesato massimo; 11.4 Post-ottimalit`a; 11.5 Il politopo del Matching; Esercizi; Riferimenti bibliografici; 12 b-Matching e T-Join; 12.1 b-Matching; 12.2 T-Join di peso minimo; 12.3 T-Join e T-Cut; 12.4 Il Teorema di Padberg-Rao; Esercizi Riferimenti bibliografici |
| Record Nr. | UNINA-9910484486003321 |
|
Korte Bernhard
|
||
| Milano : , : Springer Milan : , : Imprint : Springer, , 2011 | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. Federico II | ||
| ||
Paradigms of combinatorial optimization : problems and new approaches / / edited by Vangelis Th. Paschos
| Paradigms of combinatorial optimization : problems and new approaches / / edited by Vangelis Th. Paschos |
| Edizione | [Revised and updated second edition.] |
| Pubbl/distr/stampa | London, [England] ; ; Hoboken, New Jersey : , : ISTE : , : Wiley, , 2014 |
| Descrizione fisica | 1 online resource (815 p.) |
| Disciplina | 519.64 |
| Collana | Mathematics and Statistics Series |
| Soggetto topico |
Combinatorial optimization
Programming (Mathematics) |
| ISBN |
1-119-01519-7
1-119-00535-3 1-119-01516-2 |
| Formato | Materiale a stampa |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Nota di contenuto |
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
1.6. Satisfiability problems under global constraints 1.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 P||Cmax; 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 2.4.1.3. Complexity of the generic algorithm 2.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 3.2.3. Empty covering 3.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: Mini Max Algorithms and Games; 4.1. Introduction 4.2. Games of no chance: the simple cases 4.3. The case of complex no chance games; 4.3.1. Approximative evaluation; 4.3.2. Horizon effect; 4.3.3. α-β pruning; 4.4. Quiescence search; 4.4.1. Other refinements of the Mini Max 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 5.3.4. Bin packing: one-phase non-level heuristics |
| Record Nr. | UNINA-9910132156103321 |
| London, [England] ; ; Hoboken, New Jersey : , : ISTE : , : Wiley, , 2014 | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. Federico II | ||
| ||
