Integration of AI and OR Techniques in Constraint Programming : 14th International Conference, CPAIOR 2017, Padua, Italy, June 5-8, 2017, Proceedings /
| Autor Corporativo: | |
|---|---|
| Otros Autores: | , |
| Formato: | eBook |
| Lenguaje: | English |
| Publicado: |
Cham :
Springer International Publishing : Imprint: Springer,
2017.
|
| Edición: | 1st ed. 2017. |
| Colección: | Theoretical Computer Science and General Issues ;
10335 |
| Materias: |
Tabla de Contenidos:
- 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.