My Account Log in

1 option

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.

SpringerLink Books Lecture Notes In Computer Science (LNCS) (1997-2024) Available online

View online
Format:
Book
Contributor:
Hoeve, Willem-Jan van, editor.
SpringerLink (Online service)
Series:
Computer Science (Springer-11645)
LNCS sublibrary. Theoretical computer science and general issues ; SL 1, 10848.
Theoretical Computer Science and General Issues ; 10848
Language:
English
Subjects (All):
Numerical analysis.
Computer science--Mathematics.
Computer science.
Artificial intelligence.
Algorithms.
Operating systems (Computers).
Data structures (Computer science).
Numeric Computing.
Discrete Mathematics in Computer Science.
Artificial Intelligence.
Algorithm Analysis and Problem Complexity.
Operating Systems.
Data Structures.
Local Subjects:
Numeric Computing.
Discrete Mathematics in Computer Science.
Artificial Intelligence.
Algorithm Analysis and Problem Complexity.
Operating Systems.
Data Structures.
Physical Description:
1 online resource (XXVI, 616 pages) : 155 illustrations.
Edition:
First edition 2018.
Contained In:
Springer eBooks
Place of Publication:
Cham : Springer International Publishing : Imprint: Springer, 2018.
System Details:
text file PDF
Summary:
This book constitutes the proceedings of the 15th International Conference on Integration of Artificial Intelligence and Operations Research Techniques in Constraint Programming for Combinatorial Optimization Problems, CPAIOR 2018, held in Delft, The Netherlands, in June 2018. The 47 full papers presented together with 3 abstracts of invited talks and 3 abstracts of fast-track journal papers were carefully reviewed and selected from 111 submissions. The conference brings together interested researchers from constraint programming, artificial intelligence, and operations research to present new techniques or applications in the intersection of these fields and provides an opportunity for researchers in one area to learn about techniques in the others, and to show how the integration of techniques from different fields can lead to interesting results on large and complex problems.
Contents:
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.
Other Format:
Printed edition:
ISBN:
978-3-319-93031-2
9783319930312
Access Restriction:
Restricted for use by site license.

The Penn Libraries is committed to describing library materials using current, accurate, and responsible language. If you discover outdated or inaccurate language, please fill out this feedback form to report it and suggest alternative language.

My Account

Shelf Request an item Bookmarks Fines and fees Settings

Guides

Using the Library Catalog Using Articles+ Library Account