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.
Constraint networks [[electronic resource] ] : techniques and algorithms / / Christophe Lecoutre
| Constraint networks [[electronic resource] ] : techniques and algorithms / / Christophe Lecoutre |
| Autore | Lecoutre Christophe |
| Pubbl/distr/stampa | London, : ISTE |
| Descrizione fisica | 1 online resource (588 p.) |
| Disciplina |
004.6
005.116 |
| Collana | ISTE |
| Soggetto topico |
Constraint programming (Computer science)
Computer algorithms Computer networks |
| Soggetto genere / forma | Electronic books. |
| ISBN |
1-282-68408-6
9786612684081 0-470-61182-0 0-470-61038-7 |
| Formato | Materiale a stampa  |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Nota di contenuto |
Constraint Networks; Contents; Acknowledgements; Notation; Main Acronyms; List of Algorithms; Introduction; Chapter 1. Constraint Networks; 1.1. Variables and constraints; 1.2. Networks of variables and constraints; 1.2.1. Basic definitions; 1.2.2. Associated (hyper)graphs; 1.2.3. Instantiations and solutions; 1.3. Examples of constraint networks; 1.3.1. Queens problem; 1.3.2. Crossword problem; 1.3.3. Sudoku problem; 1.3.4. Edge-matching puzzles; 1.4. Partial orders, decisions, nogoods and properties; 1.4.1. Partial orders; 1.4.2. Decisions and nogoods
1.4.3. Properties on values and variables1.5. Data structures to represent constraint networks; 1.5.1. Representation of finite domains; 1.5.2. Representation of constraints; Chapter 2. Random and Structured Networks; 2.1. Random constraint networks; 2.1.1. Classical models; 2.1.2. Models RB and RD; 2.1.3. Random constraint networks in intension; 2.1.4. Benchmarks; 2.1.4.1. Random series; 2.1.4.2. Random series containing a small structure; 2.2. Structured constraint networks; 2.2.1. Backbones and backdoors; 2.2.2. Cores and cliques; 2.2.3. Acyclicity 2.2.4. Small world structure and morphing technique2.2.5. Benchmarks; 2.2.5.1. Main series; 2.2.5.2. Other series; Part one. Inference; Chapter 3. Consistencies; 3.1. Basic consistencies; 3.2. Stability of consistencies; 3.3. Domain-filtering consistencies; 3.4. Higher-order consistencies; 3.4.1. Taking the right path; 3.4.2. Relation-based consistencies; 3.5. Global consistency; 3.5.1. Identifying global consistency; 3.5.2. Toward tractability; 3.5.2.1. Relational CSP classes; 3.5.2.2. Structural CSP classes; 3.5.2.3. Hybrid CSP classes; 3.6. Caveats about node, arc and path consistencies Chapter 4. Generic GAC Algorithms4.1. Coarse-grained propagation schemes; 4.1.1. Arc-oriented propagation scheme; 4.1.2. Variable-oriented propagation scheme; 4.1.3. Applying forward checking; 4.2. Iterating over valid tuples; 4.3. GAC3 and GAC2001; 4.4. More about general-purpose GAC algorithms; 4.4.1. Important properties; 4.4.1.1. Incrementality; 4.4.1.2. Multi-directionality; 4.4.1.3. Substitutability; 4.4.2. Overview; 4.5. Improving the efficiency of generic GAC algorithms; 4.5.1. Exploiting cardinality of conflict sets; 4.5.2. Exploiting residues; 4.5.2.1. Algorithm GAC3rm 4.5.2.2. Complexity issues4.5.2.3. Residues within MAC; 4.5.3. Exploiting bitwise operations; 4.5.3.1. Binary representation; 4.5.3.2. Algorithms AC3bit and AC3bit+rm; 4.6. Experimental results; 4.7. Discussion; Chapter 5. Generalized Arc Consistency for Table Constraints; 5.1. Classical schemes; 5.1.1. Positive table constraints; 5.1.2. GAC-valid scheme; 5.1.3. GAC-allowed scheme; 5.1.4. Illustration; 5.2. Indexing-based approaches; 5.2.1. NextIn indexing; 5.2.2. NextDiff indexing; 5.3. Compression-based approaches; 5.3.1. Tries; 5.3.2. Multi-valued decision diagrams 5.3.3. Compressed tables |
| Record Nr. | UNINA-9910139510103321 |
Lecoutre Christophe
|
||
| London, : ISTE | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. Federico II | ||
| ||
Constraint networks [[electronic resource] ] : techniques and algorithms / / Christophe Lecoutre
| Constraint networks [[electronic resource] ] : techniques and algorithms / / Christophe Lecoutre |
| Autore | Lecoutre Christophe |
| Pubbl/distr/stampa | London, : ISTE |
| Descrizione fisica | 1 online resource (588 p.) |
| Disciplina |
004.6
005.116 |
| Collana | ISTE |
| Soggetto topico |
Constraint programming (Computer science)
Computer algorithms Computer networks |
| ISBN |
1-282-68408-6
9786612684081 0-470-61182-0 0-470-61038-7 |
| Formato | Materiale a stampa |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Nota di contenuto |
Constraint Networks; Contents; Acknowledgements; Notation; Main Acronyms; List of Algorithms; Introduction; Chapter 1. Constraint Networks; 1.1. Variables and constraints; 1.2. Networks of variables and constraints; 1.2.1. Basic definitions; 1.2.2. Associated (hyper)graphs; 1.2.3. Instantiations and solutions; 1.3. Examples of constraint networks; 1.3.1. Queens problem; 1.3.2. Crossword problem; 1.3.3. Sudoku problem; 1.3.4. Edge-matching puzzles; 1.4. Partial orders, decisions, nogoods and properties; 1.4.1. Partial orders; 1.4.2. Decisions and nogoods
1.4.3. Properties on values and variables1.5. Data structures to represent constraint networks; 1.5.1. Representation of finite domains; 1.5.2. Representation of constraints; Chapter 2. Random and Structured Networks; 2.1. Random constraint networks; 2.1.1. Classical models; 2.1.2. Models RB and RD; 2.1.3. Random constraint networks in intension; 2.1.4. Benchmarks; 2.1.4.1. Random series; 2.1.4.2. Random series containing a small structure; 2.2. Structured constraint networks; 2.2.1. Backbones and backdoors; 2.2.2. Cores and cliques; 2.2.3. Acyclicity 2.2.4. Small world structure and morphing technique2.2.5. Benchmarks; 2.2.5.1. Main series; 2.2.5.2. Other series; Part one. Inference; Chapter 3. Consistencies; 3.1. Basic consistencies; 3.2. Stability of consistencies; 3.3. Domain-filtering consistencies; 3.4. Higher-order consistencies; 3.4.1. Taking the right path; 3.4.2. Relation-based consistencies; 3.5. Global consistency; 3.5.1. Identifying global consistency; 3.5.2. Toward tractability; 3.5.2.1. Relational CSP classes; 3.5.2.2. Structural CSP classes; 3.5.2.3. Hybrid CSP classes; 3.6. Caveats about node, arc and path consistencies Chapter 4. Generic GAC Algorithms4.1. Coarse-grained propagation schemes; 4.1.1. Arc-oriented propagation scheme; 4.1.2. Variable-oriented propagation scheme; 4.1.3. Applying forward checking; 4.2. Iterating over valid tuples; 4.3. GAC3 and GAC2001; 4.4. More about general-purpose GAC algorithms; 4.4.1. Important properties; 4.4.1.1. Incrementality; 4.4.1.2. Multi-directionality; 4.4.1.3. Substitutability; 4.4.2. Overview; 4.5. Improving the efficiency of generic GAC algorithms; 4.5.1. Exploiting cardinality of conflict sets; 4.5.2. Exploiting residues; 4.5.2.1. Algorithm GAC3rm 4.5.2.2. Complexity issues4.5.2.3. Residues within MAC; 4.5.3. Exploiting bitwise operations; 4.5.3.1. Binary representation; 4.5.3.2. Algorithms AC3bit and AC3bit+rm; 4.6. Experimental results; 4.7. Discussion; Chapter 5. Generalized Arc Consistency for Table Constraints; 5.1. Classical schemes; 5.1.1. Positive table constraints; 5.1.2. GAC-valid scheme; 5.1.3. GAC-allowed scheme; 5.1.4. Illustration; 5.2. Indexing-based approaches; 5.2.1. NextIn indexing; 5.2.2. NextDiff indexing; 5.3. Compression-based approaches; 5.3.1. Tries; 5.3.2. Multi-valued decision diagrams 5.3.3. Compressed tables |
| Record Nr. | UNINA-9910830864003321 |
|
Lecoutre Christophe
|
||
| London, : ISTE | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. Federico II | ||
| ||
Constraint networks [[electronic resource] ] : techniques and algorithms / / Christophe Lecoutre
| Constraint networks [[electronic resource] ] : techniques and algorithms / / Christophe Lecoutre |
| Autore | Lecoutre Christophe |
| Pubbl/distr/stampa | London, : ISTE |
| Descrizione fisica | 1 online resource (588 p.) |
| Disciplina |
004.6
005.116 |
| Collana | ISTE |
| Soggetto topico |
Constraint programming (Computer science)
Computer algorithms Computer networks |
| ISBN |
1-282-68408-6
9786612684081 0-470-61182-0 0-470-61038-7 |
| Formato | Materiale a stampa |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Nota di contenuto |
Constraint Networks; Contents; Acknowledgements; Notation; Main Acronyms; List of Algorithms; Introduction; Chapter 1. Constraint Networks; 1.1. Variables and constraints; 1.2. Networks of variables and constraints; 1.2.1. Basic definitions; 1.2.2. Associated (hyper)graphs; 1.2.3. Instantiations and solutions; 1.3. Examples of constraint networks; 1.3.1. Queens problem; 1.3.2. Crossword problem; 1.3.3. Sudoku problem; 1.3.4. Edge-matching puzzles; 1.4. Partial orders, decisions, nogoods and properties; 1.4.1. Partial orders; 1.4.2. Decisions and nogoods
1.4.3. Properties on values and variables1.5. Data structures to represent constraint networks; 1.5.1. Representation of finite domains; 1.5.2. Representation of constraints; Chapter 2. Random and Structured Networks; 2.1. Random constraint networks; 2.1.1. Classical models; 2.1.2. Models RB and RD; 2.1.3. Random constraint networks in intension; 2.1.4. Benchmarks; 2.1.4.1. Random series; 2.1.4.2. Random series containing a small structure; 2.2. Structured constraint networks; 2.2.1. Backbones and backdoors; 2.2.2. Cores and cliques; 2.2.3. Acyclicity 2.2.4. Small world structure and morphing technique2.2.5. Benchmarks; 2.2.5.1. Main series; 2.2.5.2. Other series; Part one. Inference; Chapter 3. Consistencies; 3.1. Basic consistencies; 3.2. Stability of consistencies; 3.3. Domain-filtering consistencies; 3.4. Higher-order consistencies; 3.4.1. Taking the right path; 3.4.2. Relation-based consistencies; 3.5. Global consistency; 3.5.1. Identifying global consistency; 3.5.2. Toward tractability; 3.5.2.1. Relational CSP classes; 3.5.2.2. Structural CSP classes; 3.5.2.3. Hybrid CSP classes; 3.6. Caveats about node, arc and path consistencies Chapter 4. Generic GAC Algorithms4.1. Coarse-grained propagation schemes; 4.1.1. Arc-oriented propagation scheme; 4.1.2. Variable-oriented propagation scheme; 4.1.3. Applying forward checking; 4.2. Iterating over valid tuples; 4.3. GAC3 and GAC2001; 4.4. More about general-purpose GAC algorithms; 4.4.1. Important properties; 4.4.1.1. Incrementality; 4.4.1.2. Multi-directionality; 4.4.1.3. Substitutability; 4.4.2. Overview; 4.5. Improving the efficiency of generic GAC algorithms; 4.5.1. Exploiting cardinality of conflict sets; 4.5.2. Exploiting residues; 4.5.2.1. Algorithm GAC3rm 4.5.2.2. Complexity issues4.5.2.3. Residues within MAC; 4.5.3. Exploiting bitwise operations; 4.5.3.1. Binary representation; 4.5.3.2. Algorithms AC3bit and AC3bit+rm; 4.6. Experimental results; 4.7. Discussion; Chapter 5. Generalized Arc Consistency for Table Constraints; 5.1. Classical schemes; 5.1.1. Positive table constraints; 5.1.2. GAC-valid scheme; 5.1.3. GAC-allowed scheme; 5.1.4. Illustration; 5.2. Indexing-based approaches; 5.2.1. NextIn indexing; 5.2.2. NextDiff indexing; 5.3. Compression-based approaches; 5.3.1. Tries; 5.3.2. Multi-valued decision diagrams 5.3.3. Compressed tables |
| Record Nr. | UNINA-9910877618403321 |
|
Lecoutre Christophe
|
||
| London, : ISTE | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. Federico II | ||
| ||
Handbook of constraint programming [[electronic resource] /] / edited by Francesca Rossi, Peter van Beek, Toby Walsh
| Handbook of constraint programming [[electronic resource] /] / edited by Francesca Rossi, Peter van Beek, Toby Walsh |
| Autore | Rossi Francesca |
| Edizione | [First edition.] |
| Pubbl/distr/stampa | Amsterdam ; ; Boston, : Elsevier, 2006 |
| Descrizione fisica | 1 online resource (xi, 955 pages) : illustrations |
| Disciplina | 005.116 |
| Altri autori (Persone) |
RossiFrancesca <1962->
Van BeekPeter WalshToby |
| Collana | Foundations of artificial intelligence |
| Soggetto topico |
Constraint programming (Computer science)
Computer programming |
| Soggetto genere / forma | Electronic books. |
| ISBN |
1-280-63604-1
9786610636044 0-08-046380-0 |
| Formato | Materiale a stampa |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Nota di contenuto | Chapter 1. Introduction -- Chapter 2. Constraint satisfaction: an emerging paradigm -- Chapter 3. Constraint propagation -- Chapter 4. Backtracking search algorithms -- Chapter 5. Local search methods -- Chapter 6. Global constraints -- Chapter 7. Tractable structures for constraint satisfaction problems -- Chapter 8. The complexity of constraint languages -- Chapter 9. Soft constraints -- Chapter 10. Symmetry in constraint programming -- Chapter 11. Modelling -- Chapter 12. Constraint logic programming -- Chapter 13. Constraints in procedural and concurrent languages -- Chapter 14. Finite domain constraint programming systems -- Chapter 15. Operations research methods in constraint programming -- Chapter 16. Continuous and interval constraints -- Chapter 17. Constraints over structured domains -- Chapter 18. Randomness and structure -- Chapter 19. Temporal CSPs -- Chapter 20. Distributed constraint programming -- Chapter 21. Uncertainty and change -- Chapter 22. Constraint-based scheduling and planning -- Chapter 23. Vehicle routing -- Chapter 24. Configuration -- Chapter 25. Constraint applications in networks -- Chapter 26. Bioinformatics and constraints. |
| Record Nr. | UNINA-9910511424003321 |
|
Rossi Francesca
|
||
| Amsterdam ; ; Boston, : Elsevier, 2006 | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. Federico II | ||
| ||
Handbook of constraint programming [[electronic resource] /] / edited by Francesca Rossi, Peter van Beek, Toby Walsh
| Handbook of constraint programming [[electronic resource] /] / edited by Francesca Rossi, Peter van Beek, Toby Walsh |
| Autore | Rossi Francesca |
| Edizione | [First edition.] |
| Pubbl/distr/stampa | Amsterdam ; ; Boston, : Elsevier, 2006 |
| Descrizione fisica | 1 online resource (xi, 955 pages) : illustrations |
| Disciplina | 005.116 |
| Altri autori (Persone) |
RossiFrancesca <1962->
Van BeekPeter WalshToby |
| Collana | Foundations of artificial intelligence |
| Soggetto topico |
Constraint programming (Computer science)
Computer programming |
| ISBN |
1-280-63604-1
9786610636044 0-08-046380-0 |
| Formato | Materiale a stampa |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Nota di contenuto | Chapter 1. Introduction -- Chapter 2. Constraint satisfaction: an emerging paradigm -- Chapter 3. Constraint propagation -- Chapter 4. Backtracking search algorithms -- Chapter 5. Local search methods -- Chapter 6. Global constraints -- Chapter 7. Tractable structures for constraint satisfaction problems -- Chapter 8. The complexity of constraint languages -- Chapter 9. Soft constraints -- Chapter 10. Symmetry in constraint programming -- Chapter 11. Modelling -- Chapter 12. Constraint logic programming -- Chapter 13. Constraints in procedural and concurrent languages -- Chapter 14. Finite domain constraint programming systems -- Chapter 15. Operations research methods in constraint programming -- Chapter 16. Continuous and interval constraints -- Chapter 17. Constraints over structured domains -- Chapter 18. Randomness and structure -- Chapter 19. Temporal CSPs -- Chapter 20. Distributed constraint programming -- Chapter 21. Uncertainty and change -- Chapter 22. Constraint-based scheduling and planning -- Chapter 23. Vehicle routing -- Chapter 24. Configuration -- Chapter 25. Constraint applications in networks -- Chapter 26. Bioinformatics and constraints. |
| Record Nr. | UNINA-9910784600303321 |
|
Rossi Francesca
|
||
| Amsterdam ; ; Boston, : Elsevier, 2006 | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. Federico II | ||
| ||
Integration of AI and OR Techniques in Constraint Programming [[electronic resource] ] : 14th International Conference, CPAIOR 2017, Padua, Italy, June 5-8, 2017, Proceedings / / edited by Domenico Salvagnin, Michele Lombardi
| Integration of AI and OR Techniques in Constraint Programming [[electronic resource] ] : 14th International Conference, CPAIOR 2017, Padua, Italy, June 5-8, 2017, Proceedings / / edited by Domenico Salvagnin, Michele Lombardi |
| Edizione | [1st ed. 2017.] |
| Pubbl/distr/stampa | Cham : , : Springer International Publishing : , : Imprint : Springer, , 2017 |
| Descrizione fisica | 1 online resource (XXIII, 420 p. 78 illus.) |
| Disciplina | 005.116 |
| Collana | Theoretical Computer Science and General Issues |
| Soggetto topico |
Numerical analysis
Artificial intelligence—Data processing Computer science—Mathematics Discrete mathematics Algorithms Artificial intelligence Operations research Management science Numerical Analysis Data Science Discrete Mathematics in Computer Science Artificial Intelligence Operations Research, Management Science |
| ISBN | 3-319-59776-0 |
| Formato | Materiale a stampa |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Nota di contenuto | Sharpening Constraint Programming approaches for Bit-Vector Theory -- Range-Consistent Forbidden Regions of Allen's Relations -- MDDs are Efficient Modeling Tools: An Application to Dispersion Constraints -- On Finding the Optimal Relaxed Decision Diagram -- Design and Implementation of Bounded-Length Sequence Variables -- In Search of Balance: The Challenge of Generating Balanced Latin Rectangles -- Debugging Unsatisfiable Constraint Models -- Learning Decision Trees with Exible Constraints and Objectives Using Integer Optimization -- Relaxation Methods for Constrained Matrix Factorization Problems: Solving the Phase Mapping Problem in Materials Discovery -- Minimizing Landscape Resistance for Habitat Conservation -- A Hybrid Approach for Stator Winding Design Optimization -- A Distributed Optimal Method for the Geographically Distributed Data Centres Problem -- Explanation-Based-Weighted Degree -- Counting-Weighted Spanning Trees to Solve Constrained Minimum Spanning Tree Problems -- The Weighted Arborescence Constraint -- Learning When to Use a Decomposition -- Experiments with Conict Analysis in Mixed Integer Programming -- A First Look at Picking Dual Variables for Maximizing Reduced-cost Based fixing -- Experimental Validation of Volume-based Comparison for Double-McCormick Relaxations -- Vehicle Routing Problem with Min-max Objective and Heterogeneous Fleet -- Solving the Traveling Salesman Problem with Time Windows with Dynamic Discretization Discovery -- A Fast Prize-collecting Steiner Forest Algorithm for Functional Analyses in Biological Networks -- Scenario Based Learning for Stochastic Combinatorial Optimization -- Optimal Stock Sizing in a Cutting Stock Problem with Stochastic Demands -- Stochastic Task Networks: Trading Performance for Stability -- Rescheduling Railway Traffic on Real Time Situations Using Time-Interval Variables -- A Multi-stage Simulated Annealing Algorithm for the Torpedo Scheduling Problem -- Combining CP and ILP in a Tree Decomposition of Bounded Height to Solve the Sum Coloring Problem -- A Free, Open-Source Framework for (Customized) Tree Decompositions and Beyond -- The Nemhauser-Trotter Reduction and Lifted Message Passing for Weighted CSPs -- A Local Search Approach for Incomplete Soft Constraint Problems: Experimental Results on Meeting Scheduling Problems. |
| Record Nr. | UNISA-996466284503316 |
| Cham : , : Springer International Publishing : , : Imprint : Springer, , 2017 | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. di Salerno | ||
| ||
Integration of AI and OR Techniques in Constraint Programming : 14th International Conference, CPAIOR 2017, Padua, Italy, June 5-8, 2017, Proceedings / / edited by Domenico Salvagnin, Michele Lombardi
| Integration of AI and OR Techniques in Constraint Programming : 14th International Conference, CPAIOR 2017, Padua, Italy, June 5-8, 2017, Proceedings / / edited by Domenico Salvagnin, Michele Lombardi |
| Edizione | [1st ed. 2017.] |
| Pubbl/distr/stampa | Cham : , : Springer International Publishing : , : Imprint : Springer, , 2017 |
| Descrizione fisica | 1 online resource (XXIII, 420 p. 78 illus.) |
| Disciplina | 005.116 |
| Collana | Theoretical Computer Science and General Issues |
| Soggetto topico |
Numerical analysis
Artificial intelligence—Data processing Computer science—Mathematics Discrete mathematics Algorithms Artificial intelligence Operations research Management science Numerical Analysis Data Science Discrete Mathematics in Computer Science Artificial Intelligence Operations Research, Management Science |
| ISBN | 3-319-59776-0 |
| Formato | Materiale a stampa |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Nota di contenuto | Sharpening Constraint Programming approaches for Bit-Vector Theory -- Range-Consistent Forbidden Regions of Allen's Relations -- MDDs are Efficient Modeling Tools: An Application to Dispersion Constraints -- On Finding the Optimal Relaxed Decision Diagram -- Design and Implementation of Bounded-Length Sequence Variables -- In Search of Balance: The Challenge of Generating Balanced Latin Rectangles -- Debugging Unsatisfiable Constraint Models -- Learning Decision Trees with Exible Constraints and Objectives Using Integer Optimization -- Relaxation Methods for Constrained Matrix Factorization Problems: Solving the Phase Mapping Problem in Materials Discovery -- Minimizing Landscape Resistance for Habitat Conservation -- A Hybrid Approach for Stator Winding Design Optimization -- A Distributed Optimal Method for the Geographically Distributed Data Centres Problem -- Explanation-Based-Weighted Degree -- Counting-Weighted Spanning Trees to Solve Constrained Minimum Spanning Tree Problems -- The Weighted Arborescence Constraint -- Learning When to Use a Decomposition -- Experiments with Conict Analysis in Mixed Integer Programming -- A First Look at Picking Dual Variables for Maximizing Reduced-cost Based fixing -- Experimental Validation of Volume-based Comparison for Double-McCormick Relaxations -- Vehicle Routing Problem with Min-max Objective and Heterogeneous Fleet -- Solving the Traveling Salesman Problem with Time Windows with Dynamic Discretization Discovery -- A Fast Prize-collecting Steiner Forest Algorithm for Functional Analyses in Biological Networks -- Scenario Based Learning for Stochastic Combinatorial Optimization -- Optimal Stock Sizing in a Cutting Stock Problem with Stochastic Demands -- Stochastic Task Networks: Trading Performance for Stability -- Rescheduling Railway Traffic on Real Time Situations Using Time-Interval Variables -- A Multi-stage Simulated Annealing Algorithm for the Torpedo Scheduling Problem -- Combining CP and ILP in a Tree Decomposition of Bounded Height to Solve the Sum Coloring Problem -- A Free, Open-Source Framework for (Customized) Tree Decompositions and Beyond -- The Nemhauser-Trotter Reduction and Lifted Message Passing for Weighted CSPs -- A Local Search Approach for Incomplete Soft Constraint Problems: Experimental Results on Meeting Scheduling Problems. |
| Record Nr. | UNINA-9910483475603321 |
| Cham : , : Springer International Publishing : , : Imprint : Springer, , 2017 | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. Federico II | ||
| ||
Integration of AI and OR Techniques in Constraint Programming [[electronic resource] ] : 13th International Conference, CPAIOR 2016, Banff, AB, Canada, May 29 - June 1, 2016, Proceedings / / edited by Claude-Guy Quimper
| Integration of AI and OR Techniques in Constraint Programming [[electronic resource] ] : 13th International Conference, CPAIOR 2016, Banff, AB, Canada, May 29 - June 1, 2016, Proceedings / / edited by Claude-Guy Quimper |
| Edizione | [1st ed. 2016.] |
| Pubbl/distr/stampa | Cham : , : Springer International Publishing : , : Imprint : Springer, , 2016 |
| Descrizione fisica | 1 online resource (XIX, 421 p. 123 illus.) |
| Disciplina | 005.116 |
| Collana | Theoretical Computer Science and General Issues |
| Soggetto topico |
Numerical analysis
Computer science—Mathematics Discrete mathematics Algorithms Artificial intelligence Operations research Management science Numerical Analysis Mathematical Applications in Computer Science Discrete Mathematics in Computer Science Artificial Intelligence Operations Research, Management Science |
| ISBN | 3-319-33954-0 |
| Formato | Materiale a stampa |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Nota di contenuto | On CNF Encodings for Decision Diagrams -- Time-Series Constraints: Improvements and Application in CP and MIP Contexts -- Finding a Collection of MUSes Incrementally -- Decompositions Based on Decision Diagrams -- Logic-Based Decomposition Methods for the Travelling Purchaser Problem -- Lagrangian Decomposition via Subproblem Search -- Non-linear Optimization of Business Models in the Electricity Market -- Weighted Spanning Tree Constraint with Explanations -- Forward-Checking ltering for Nested Cardinality Constraints: Application to an Energy Cost Aware Production Planning Problem for Tissue Manufacturing -- Cyclic Routing of Unmanned Aerial Vehicles -- Parallelizing Constraint Programming with Learning -- Parallel Composition of Scheduling Solvers -- Rail Capacity Planning With Constraint Programming -- Scheduling Home Hospice Care with Logic-Based Benders Decomposition -- A Global Constraint for Mining Sequential Patterns with GAP Constraint -- A Reservoir Balancing Constraint with Applications to Bike-Sharing -- Optimization Models for a Real-World Snow Plow Routing Problem -- The TASKINTERSECTION Constraint -- A Stochastic Continuous Optimization Backend for MiniZinc with Applications to Geometrical Placement Problems -- Constructions and In-place Operations for MDDs Based Constraints -- Balancing Nursing Workload by Constraint Programming -- Designing Spacecraft Command Loops Using Two-Dimension Vehicle Routing -- Constraint Programming Approach for Spatial Packaging Problem -- Detecting Semantic Groups in MIP Models -- Revisiting Two-Sided Stability Constraints -- Optimal Flood Mitigation over Flood Propagation Approximations -- A Bit-Vector Solver with Word Level Propagation -- A New Solver for the Minimum Weighted Vertex Cover Problem -- Optimal Upgrading Schemes for Eective Shortest Paths in Networks. |
| Record Nr. | UNISA-996465781903316 |
| Cham : , : Springer International Publishing : , : Imprint : Springer, , 2016 | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. di Salerno | ||
| ||
Integration of AI and OR Techniques in Constraint Programming : 13th International Conference, CPAIOR 2016, Banff, AB, Canada, May 29 - June 1, 2016, Proceedings / / edited by Claude-Guy Quimper
| Integration of AI and OR Techniques in Constraint Programming : 13th International Conference, CPAIOR 2016, Banff, AB, Canada, May 29 - June 1, 2016, Proceedings / / edited by Claude-Guy Quimper |
| Edizione | [1st ed. 2016.] |
| Pubbl/distr/stampa | Cham : , : Springer International Publishing : , : Imprint : Springer, , 2016 |
| Descrizione fisica | 1 online resource (XIX, 421 p. 123 illus.) |
| Disciplina | 005.116 |
| Collana | Theoretical Computer Science and General Issues |
| Soggetto topico |
Numerical analysis
Computer science—Mathematics Discrete mathematics Algorithms Artificial intelligence Operations research Management science Numerical Analysis Mathematical Applications in Computer Science Discrete Mathematics in Computer Science Artificial Intelligence Operations Research, Management Science |
| ISBN | 3-319-33954-0 |
| Formato | Materiale a stampa |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Nota di contenuto | On CNF Encodings for Decision Diagrams -- Time-Series Constraints: Improvements and Application in CP and MIP Contexts -- Finding a Collection of MUSes Incrementally -- Decompositions Based on Decision Diagrams -- Logic-Based Decomposition Methods for the Travelling Purchaser Problem -- Lagrangian Decomposition via Subproblem Search -- Non-linear Optimization of Business Models in the Electricity Market -- Weighted Spanning Tree Constraint with Explanations -- Forward-Checking ltering for Nested Cardinality Constraints: Application to an Energy Cost Aware Production Planning Problem for Tissue Manufacturing -- Cyclic Routing of Unmanned Aerial Vehicles -- Parallelizing Constraint Programming with Learning -- Parallel Composition of Scheduling Solvers -- Rail Capacity Planning With Constraint Programming -- Scheduling Home Hospice Care with Logic-Based Benders Decomposition -- A Global Constraint for Mining Sequential Patterns with GAP Constraint -- A Reservoir Balancing Constraint with Applications to Bike-Sharing -- Optimization Models for a Real-World Snow Plow Routing Problem -- The TASKINTERSECTION Constraint -- A Stochastic Continuous Optimization Backend for MiniZinc with Applications to Geometrical Placement Problems -- Constructions and In-place Operations for MDDs Based Constraints -- Balancing Nursing Workload by Constraint Programming -- Designing Spacecraft Command Loops Using Two-Dimension Vehicle Routing -- Constraint Programming Approach for Spatial Packaging Problem -- Detecting Semantic Groups in MIP Models -- Revisiting Two-Sided Stability Constraints -- Optimal Flood Mitigation over Flood Propagation Approximations -- A Bit-Vector Solver with Word Level Propagation -- A New Solver for the Minimum Weighted Vertex Cover Problem -- Optimal Upgrading Schemes for Eective Shortest Paths in Networks. |
| Record Nr. | UNINA-9910483569903321 |
| Cham : , : Springer International Publishing : , : Imprint : Springer, , 2016 | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. Federico II | ||
| ||
Integration of Constraint Programming, Artificial Intelligence, and Operations Research : 19th International Conference, CPAIOR 2022, Los Angeles, CA, USA, June 20-23, 2022, Proceedings / / edited by Pierre Schaus
| Integration of Constraint Programming, Artificial Intelligence, and Operations Research : 19th International Conference, CPAIOR 2022, Los Angeles, CA, USA, June 20-23, 2022, Proceedings / / edited by Pierre Schaus |
| Edizione | [1st ed. 2022.] |
| Pubbl/distr/stampa | Cham : , : Springer International Publishing : , : Imprint : Springer, , 2022 |
| Descrizione fisica | 1 online resource (459 pages) |
| Disciplina |
006.3
005.116 |
| Collana | Lecture Notes in Computer Science |
| Soggetto topico |
Computer science - Mathematics
Artificial intelligence Computer science Computer engineering Computer networks Mathematics of Computing Artificial Intelligence Theory of Computation Computer Engineering and Networks |
| ISBN |
9783031080111
9783031080104 |
| Formato | Materiale a stampa |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Nota di contenuto | A Two-Phase Hybrid Approach for the Hybrid Flexible Flowshop with Transportation Times -- A SAT Encoding to compute Aperiodic Tiling Rhythmic Canons -- Transferring Information across Restarts in MIP -- Towards Copeland Optimization in Combinatorial Problems -- Coupling Different Integer Encodings for SAT -- Model-Based Algorithm Configuration with Adaptive Capping and Prior Distributions -- Shattering Inequalities for Learning Optimal Decision Trees -- Learning Pseudo-Backdoors for Mixed Integer Programs -- Leveraging Integer Linear Programming to Learn Optimal Fair Rule Lists -- Solving the Job Shop Scheduling Problem extended with AGVs – Classical and Quantum Approaches -- Stochastic Decision Diagrams -- Improving the robustness of EPS to solve the TSP -- Efficient operations between MDDs and constraints -- Deep Policy Dynamic Programming for Vehicle Routing Problems -- Learning a Propagation Complete Formula -- A FastMap-Based Algorithm for Block Modeling -- Packing by Scheduling: Using Constraint Programming to Solve a Complex 2D Cutting Stock Problem -- Dealing with the product constraint -- Multiple-choice knapsack constraint in graphical models -- A Learning Large Neighborhood Search for the Staff Rerostering Problem -- Practically Uniform Solution Sampling in Constraint Programming -- Training Thinner and Deeper Neural Networks: Jumpstart Regularization -- Hybrid Offline/Online Optimization for Energy Management via Reinforcement Learning -- Enumerated Types and Type Extensions for MiniZinc -- A parallel algorithm for generalized arc-consistent filtering for the Alldifferent constraint -- Analyzing the Reachability Problem in Choice Networks -- Model-based Approaches to Multi-Attribute Diverse Matching. |
| Record Nr. | UNINA-9910574856903321 |
| Cham : , : Springer International Publishing : , : Imprint : Springer, , 2022 | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. Federico II | ||
| ||
