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.
Decision diagrams for optimization / / by David Bergman, Andre A. Cire, Willem-Jan van Hoeve, John Hooker
| Decision diagrams for optimization / / by David Bergman, Andre A. Cire, Willem-Jan van Hoeve, John Hooker |
| Autore | Bergman David |
| Edizione | [1st ed. 2016.] |
| Pubbl/distr/stampa | Cham : , : Springer International Publishing : , : Imprint : Springer, , 2016 |
| Descrizione fisica | 1 online resource (XII, 254 p. 79 illus.) |
| Disciplina | 006.3 |
| Collana | Artificial Intelligence: Foundations, Theory, and Algorithms |
| Soggetto topico |
Artificial intelligence
Operations research Decision making Mathematical optimization Management science Computers Artificial Intelligence Operations Research/Decision Theory Discrete Optimization Operations Research, Management Science Theory of Computation |
| ISBN | 3-319-42849-7 |
| Formato | Materiale a stampa  |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Nota di contenuto | Introduction -- Historical Overview -- Exact Decision Diagrams -- Relaxed Decision Diagrams -- Restricted Decision Diagrams -- Branch-and-Bound Based on Decision Diagrams -- Variable Ordering -- Recursive Modeling -- MDD-Based Constraint Programming -- MDD Propagation for Sequence Constraints -- Sequencing and Single-Machine Scheduling -- Index. |
| Record Nr. | UNINA-9910149631303321 |
Bergman David
|
||
| Cham : , : Springer International Publishing : , : Imprint : Springer, , 2016 | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. Federico II | ||
| ||
Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems [[electronic resource] ] : 6th International Conference, CPAIOR 2009 Pittsburgh, PA, USA, May 27-31, 2009 Proceedings / / edited by Willem-Jan van Hoeve, John N. Hooker
| Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems [[electronic resource] ] : 6th International Conference, CPAIOR 2009 Pittsburgh, PA, USA, May 27-31, 2009 Proceedings / / edited by Willem-Jan van Hoeve, John N. Hooker |
| Edizione | [1st ed. 2009.] |
| Pubbl/distr/stampa | Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2009 |
| Descrizione fisica | 1 online resource (XI, 332 p.) |
| Disciplina | 518 |
| Collana | Theoretical Computer Science and General Issues |
| Soggetto topico |
Numerical analysis
Computer science—Mathematics Discrete mathematics Algorithms Artificial intelligence Operations research Numerical Analysis Discrete Mathematics in Computer Science Artificial Intelligence Operations Research and Decision Theory Discrete Mathematics |
| ISBN | 3-642-01929-3 |
| Formato | Materiale a stampa |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Nota di contenuto | Invited Talks -- Machine Learning Framework for Classification in Medicine and Biology -- G12 - Towards the Separation of Problem Modelling and Problem Solving -- Regular Papers -- Six Ways of Integrating Symmetries within Non-overlapping Constraints -- Throughput Constraint for Synchronous Data Flow Graphs -- A Shortest Path-Based Approach to the Multileaf Collimator Sequencing Problem -- Backdoors to Combinatorial Optimization: Feasibility and Optimality -- Solution Enumeration for Projected Boolean Search Problems -- k-Clustering Minimum Biclique Completion via a Hybrid CP and SDP Approach -- Optimal Interdiction of Unreactive Markovian Evaders -- Using Model Counting to Find Optimal Distinguishing Tests -- Reformulating Global Grammar Constraints -- IBM ILOG CP Optimizer for Detailed Scheduling Illustrated on Three Problems -- Open Constraints in a Boundable World -- Sequencing and Counting with the multicost-regular Constraint -- Bandwidth-Limited Optimal Deployment of Eventually-Serializable Data Services -- Tightening the Linear Relaxation of a Mixed Integer Nonlinear Program Using Constraint Programming -- The Polytope of Context-Free Grammar Constraints -- Determining the Number of Games Needed to Guarantee an NHL Playoff Spot -- Scalable Load Balancing in Nurse to Patient Assignment Problems -- Learning How to Propagate Using Random Probing -- DFS* and the Traveling Tournament Problem -- Max Energy Filtering Algorithm for Discrete Cumulative Resources -- Extended Abstracts -- Hybrid Branching -- Constraint Programming and Mixed Integer Linear Programming for Rescheduling Trains under Disrupted Operations -- Constraint Models for Sequential Planning -- A Fast Algorithm to Solve the Frequency Assignment Problem -- A Hybrid LS/CP Approach to Solve the Weekly Log-Truck Scheduling Problem -- Modelling Search Strategies in Rules2CP -- CP-INSIDE: Embedding Constraint-Based Decision Engines in Business Applications -- An Integrated Genetic Algorithm and Integer Programming Approach to the Network Design Problem with Relays -- A Benders’Approach to a Transportation Network Design Problem -- Progress on the Progressive Party Problem. |
| Record Nr. | UNISA-996466268603316 |
| Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2009 | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. di Salerno | ||
| ||
Integration of Constraint Programming, Artificial Intelligence, and Operations Research [[electronic resource] ] : 15th International Conference, CPAIOR 2018, Delft, The Netherlands, June 26–29, 2018, Proceedings / / edited by Willem-Jan van Hoeve
| Integration of Constraint Programming, Artificial Intelligence, and Operations Research [[electronic resource] ] : 15th International Conference, CPAIOR 2018, Delft, The Netherlands, June 26–29, 2018, Proceedings / / edited by Willem-Jan van Hoeve |
| Edizione | [1st ed. 2018.] |
| Pubbl/distr/stampa | Cham : , : Springer International Publishing : , : Imprint : Springer, , 2018 |
| Descrizione fisica | 1 online resource (XXVI, 616 p. 155 illus.) |
| Disciplina | 005.11 |
| Collana | Theoretical Computer Science and General Issues |
| Soggetto topico |
Numerical analysis
Computer science—Mathematics Discrete mathematics Artificial intelligence Algorithms Operating systems (Computers) Artificial intelligence—Data processing Numerical Analysis Discrete Mathematics in Computer Science Artificial Intelligence Operating Systems Data Science |
| ISBN | 3-319-93031-1 |
| Formato | Materiale a stampa |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Nota di contenuto | Time-bounded Query Generator for Constraint Acquisition -- Propagating lex, Find and Replace with Dashed Strings -- Designing Fair, Effcient, and Interpretable Policies for Prioritizing Homeless Youth for Housing Resources -- An Efficient Relaxed Projection Method for Constrained Non-negative Matrix Factorization with Application to the Phase-Mapping Problem in Materials Science -- Dealing with Demand Uncertainty in Service Network and Load Plan Design -- Energy-Aware Production Scheduling with Power-Saving Modes -- Episode Support: A Global Constraint for Mining Frequent Patterns in A Long Sequence of Events -- Off-line and on-line Optimization Under Uncertainty: A Case Study on Energy Management -- Reasoning on Sequences in Constraint-Based Local Search Frameworks -- Guiding Constraint Programming with Hot Starts for High School Timetabling -- Epiphytic Trees: Relational Consistency Applied to Global Optimization Problems -- Learning Heuristics for the TSP by Policy Gradient -- Three-Dimensional Matching Instances Are Rich in Stable Matchings -- From Backdoor Key to Backdoor Completability: Improving a Known Measure of Hardness for the Satisfiable CSP -- Constrained-based Differential Privacy: Releasing Optimal Power Flow Benchmarks Privately -- Chasing First Queens by Integer Programming -- Accelerating Counting-Based Search -- Model Agnostic Solution of CSPs via Deep Learning: A Preliminary Study -- Boosting Efficiency for Computing the Pareto Frontier on Tree Structured Networks -- Bandits Help Simulated Annealing to Complete a Maximin Latin Hypercube Design -- A Dynamic Discretization Discovery Algorithm for the Minimum Duration Time-Dependent Shortest Path Problem -- Observations from Parallelising Three Maximum Common (Connected) Subgraph Algorithms -- Horizontally Elastic Not-First/Not-Last Filtering Algorithm for Cumulative Resource Constraint -- Soft-regular with a Prefix-size Violation Measure -- Constraint and Mathematical Programming for Integrated Port Container Terminal Operations -- Heuristic Variants for A* Search in 3D Flight Planning -- Juniper: An Open-Source Nonlinear Branch-and-Bound Solver in Julia -- Objective Landscapes for Constraint Programming -- An Update on the Comparison of MIP, CP and Hybrid Approaches for Mixed Resource Allocation and Scheduling -- Modeling and Solving the Senior Transportation Problem -- Solver Independent Rotating Workforce Scheduling -- Greedy Randomized Search for Scalable Compilation of Quantum Circuits -- A Comparison of Optimization Methods for Multi-Objective Constrained Bin Packing Problems -- A O(n log^2 n) Checker and O(n^2 log n) Filtering Algorithm for the Energetic Reasoning -- The Weighted Circuits LMax Constraint -- A Local Search Framework for Compiling Relaxed Decision Diagrams -- Symmetry Breaking Inequalities from the Schreier-Sims table -- Frequency-based Multi-agent Patrolling Model and Its Area Partitioning Solution Method for Balanced Workload -- Algorithms for Sparse k-Monotone Regression -- Revisiting the Self-Adaptive Large Neighbourhood Search -- A Warning Propagation-Based Linear-Time-and-Space Algorithm for the Minimum Vertex Cover Problem on Giant Graphs -- Symbolic Bucket Elimination for Piecewise Continuous Constrained Optimization -- Learning a Classification of Mixed-Integer Quadratic Programming Problems -- Fleet Scheduling in Underground Mines using Constraint Programming. |
| Record Nr. | UNISA-996465792103316 |
| Cham : , : Springer International Publishing : , : Imprint : Springer, , 2018 | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. di Salerno | ||
| ||
Integration of Constraint Programming, Artificial Intelligence, and Operations Research : 15th International Conference, CPAIOR 2018, Delft, The Netherlands, June 26–29, 2018, Proceedings / / edited by Willem-Jan van Hoeve
| Integration of Constraint Programming, Artificial Intelligence, and Operations Research : 15th International Conference, CPAIOR 2018, Delft, The Netherlands, June 26–29, 2018, Proceedings / / edited by Willem-Jan van Hoeve |
| Edizione | [1st ed. 2018.] |
| Pubbl/distr/stampa | Cham : , : Springer International Publishing : , : Imprint : Springer, , 2018 |
| Descrizione fisica | 1 online resource (XXVI, 616 p. 155 illus.) |
| Disciplina | 005.11 |
| Collana | Theoretical Computer Science and General Issues |
| Soggetto topico |
Numerical analysis
Computer science—Mathematics Discrete mathematics Artificial intelligence Algorithms Operating systems (Computers) Artificial intelligence—Data processing Numerical Analysis Discrete Mathematics in Computer Science Artificial Intelligence Operating Systems Data Science |
| ISBN | 3-319-93031-1 |
| Formato | Materiale a stampa |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Nota di contenuto | Time-bounded Query Generator for Constraint Acquisition -- Propagating lex, Find and Replace with Dashed Strings -- Designing Fair, Effcient, and Interpretable Policies for Prioritizing Homeless Youth for Housing Resources -- An Efficient Relaxed Projection Method for Constrained Non-negative Matrix Factorization with Application to the Phase-Mapping Problem in Materials Science -- Dealing with Demand Uncertainty in Service Network and Load Plan Design -- Energy-Aware Production Scheduling with Power-Saving Modes -- Episode Support: A Global Constraint for Mining Frequent Patterns in A Long Sequence of Events -- Off-line and on-line Optimization Under Uncertainty: A Case Study on Energy Management -- Reasoning on Sequences in Constraint-Based Local Search Frameworks -- Guiding Constraint Programming with Hot Starts for High School Timetabling -- Epiphytic Trees: Relational Consistency Applied to Global Optimization Problems -- Learning Heuristics for the TSP by Policy Gradient -- Three-Dimensional Matching Instances Are Rich in Stable Matchings -- From Backdoor Key to Backdoor Completability: Improving a Known Measure of Hardness for the Satisfiable CSP -- Constrained-based Differential Privacy: Releasing Optimal Power Flow Benchmarks Privately -- Chasing First Queens by Integer Programming -- Accelerating Counting-Based Search -- Model Agnostic Solution of CSPs via Deep Learning: A Preliminary Study -- Boosting Efficiency for Computing the Pareto Frontier on Tree Structured Networks -- Bandits Help Simulated Annealing to Complete a Maximin Latin Hypercube Design -- A Dynamic Discretization Discovery Algorithm for the Minimum Duration Time-Dependent Shortest Path Problem -- Observations from Parallelising Three Maximum Common (Connected) Subgraph Algorithms -- Horizontally Elastic Not-First/Not-Last Filtering Algorithm for Cumulative Resource Constraint -- Soft-regular with a Prefix-size Violation Measure -- Constraint and Mathematical Programming for Integrated Port Container Terminal Operations -- Heuristic Variants for A* Search in 3D Flight Planning -- Juniper: An Open-Source Nonlinear Branch-and-Bound Solver in Julia -- Objective Landscapes for Constraint Programming -- An Update on the Comparison of MIP, CP and Hybrid Approaches for Mixed Resource Allocation and Scheduling -- Modeling and Solving the Senior Transportation Problem -- Solver Independent Rotating Workforce Scheduling -- Greedy Randomized Search for Scalable Compilation of Quantum Circuits -- A Comparison of Optimization Methods for Multi-Objective Constrained Bin Packing Problems -- A O(n log^2 n) Checker and O(n^2 log n) Filtering Algorithm for the Energetic Reasoning -- The Weighted Circuits LMax Constraint -- A Local Search Framework for Compiling Relaxed Decision Diagrams -- Symmetry Breaking Inequalities from the Schreier-Sims table -- Frequency-based Multi-agent Patrolling Model and Its Area Partitioning Solution Method for Balanced Workload -- Algorithms for Sparse k-Monotone Regression -- Revisiting the Self-Adaptive Large Neighbourhood Search -- A Warning Propagation-Based Linear-Time-and-Space Algorithm for the Minimum Vertex Cover Problem on Giant Graphs -- Symbolic Bucket Elimination for Piecewise Continuous Constrained Optimization -- Learning a Classification of Mixed-Integer Quadratic Programming Problems -- Fleet Scheduling in Underground Mines using Constraint Programming. |
| Record Nr. | UNINA-9910349435103321 |
| Cham : , : Springer International Publishing : , : Imprint : Springer, , 2018 | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. Federico II | ||
| ||