Muutke küpsiste eelistusi

Integration of Constraint Programming, Artificial Intelligence, and Operations Research: 16th International Conference, CPAIOR 2019, Thessaloniki, Greece, June 47, 2019, Proceedings 2019 ed. [Pehme köide]

  • Formaat: Paperback / softback, 662 pages, kõrgus x laius: 235x155 mm, kaal: 1032 g, 91 Illustrations, color; 298 Illustrations, black and white; XX, 662 p. 389 illus., 91 illus. in color., 1 Paperback / softback
  • Sari: Lecture Notes in Computer Science 11494
  • Ilmumisaeg: 28-Apr-2019
  • Kirjastus: Springer Nature Switzerland AG
  • ISBN-10: 3030192113
  • ISBN-13: 9783030192112
  • Pehme köide
  • Hind: 48,70 €*
  • * hind on lõplik, st. muud allahindlused enam ei rakendu
  • Tavahind: 57,29 €
  • Säästad 15%
  • Raamatu kohalejõudmiseks kirjastusest kulub orienteeruvalt 2-4 nädalat
  • Kogus:
  • Lisa ostukorvi
  • Tasuta tarne
  • Tellimisaeg 2-4 nädalat
  • Lisa soovinimekirja
  • Formaat: Paperback / softback, 662 pages, kõrgus x laius: 235x155 mm, kaal: 1032 g, 91 Illustrations, color; 298 Illustrations, black and white; XX, 662 p. 389 illus., 91 illus. in color., 1 Paperback / softback
  • Sari: Lecture Notes in Computer Science 11494
  • Ilmumisaeg: 28-Apr-2019
  • Kirjastus: Springer Nature Switzerland AG
  • ISBN-10: 3030192113
  • ISBN-13: 9783030192112

This book constitutes the proceedings of the 16th International Conference on Integration of Constraint Programming, Artificial Intelligence, and Operations Research, CPAIOR 2019, held in Thessaloniki, Greece, in June 2019.
The 34 full papers presented together with 9 short papers were carefully reviewed and selected from 94 submissions. The conference brings together interested researchers from Constraint Programming (CP), Artificial Intelligence (AI), and Operations Research (OR) to present new techniques or applications and to provide an opportunity for researchers in one area to learn about techniques in the others. A main objective of this conference series is also to give these researchers the opportunity to show how the integration of techniques from different fields can lead to interesting results on large and complex problems.

Constraint Programming for Dynamic Symbolic Execution of JavaScript
1(19)
Roberto Amadini
Mak Andrlon
Graeme Gange
Peter Schachte
Harald Sandergaard
Peter J. Stuckey
Sequential and Parallel Solution-Biased Search for Subgraph Algorithms
20(19)
Blair Archibald
Fraser Dunlop
Ruth Hoffmann
Ciaran McCreesh
Patrick Prosser
James Trimble
Core-Boosted Linear Search for Incomplete MaxSAT
39(18)
Jeremias Berg
Emir Demirovic
Peter J. Stuckey
Binary Decision Diagrams for Bin Packing with Minimum Color Fragmentation
57(10)
David Bergman
Carlos Cardonha
Saharnaz Mehrani
Local Rapid Learning for Integer Programs
67(17)
Timo Berthold
Peter J. Stuckey
Jakob Witzig
A Status Report on Conflict Analysis in Mixed Integer Nonlinear Programming
84(11)
Jakob Witzig
Timo Berthold
Stefan Heinz
Generating Compound Moves in Local Search by Hybridisation with Complete Search
95(17)
Gustav Bjdrdal
Pierre Flener
Justin Pearson
SAT Encodings of Pseudo-Boolean Constraints with At-Most-One Relations
112(17)
Miquel Bofill
Jordi Coll
Josep Suy
Mateu Villaret
A Constraint Programming Approach to Electric Vehicle Routing with Time Windows
129(17)
Kyle E. C. Booth
J. Christopher Beck
A Sampling-Free Anticipatory Algorithm for the Kidney Exchange Problem
146(17)
Danuta Sorina Chisca
Michele Lombardi
Michela Milano
Barry O'Sullivan
Evaluating Ising Processing Units with Integer Programming
163(19)
Carleton Coffrin
Harsha Nagarajan
Russell Bent
Using Cost-Based Solution Densities from TSP Relaxations to Solve Routing Problems
182(10)
Pierre Caste
Andrea Lodi
Gilles Pesant
A Counting-Based Approach to Scalable Micro-service Deployment
192(16)
Waldemar Cruz
Fanghui Liu
Laurent Michel
An Optimization Approach to the Ordering Phase of an Attended Home Delivery Service
208(17)
Giinther Cwioro
Philipp Hungerldnder
Kerstin Maier
Jorg Pocher
Christian Truden
Consistency for 0---1 Programming
225(16)
Denial Davarnia
J. N. Hooker
An Investigation into Prediction + Optimisation for the Knapsack Problem
241(17)
Emir Demirovic
Peter J. Stuckey
James Bailey
Jeffrey Chan
Chris Leckie
Kotagiri Ramamohanarao
Tias Guns
The Maximum Weighted Submatrix Coverage Problem: A CP Approach
258(17)
Guillautne Derval
Vincent Branders
Pierre Dupont
Pierre Schaus
Learning MILP Resolution Outcomes Before Reaching Time-Limit
275(17)
Martina Fischetti
Andrea Lodi
Giulia Zarpellon
An Improved Subsumption Testing Algorithm for the Optimal-Size Sorting Network Problem
292(12)
Cristian Frdsinaru
Mdddlina Rdschip
Investigating Constraint Programming for Real World Industrial Test Laboratory Scheduling
304(16)
Tobias Geibinger
Florian Mischek
Nysret Musliu
An Approach to Robustness in the Stable Roommates Problem and Its Comparison with the Stable Marriage Problem
320(17)
Begum Gene
Mohamed Siala
Gilles Simonin
Barry O'Sullivan
Optimality Clue for Graph Coloring Problem
337(18)
Alexandre Gondran
Laurent Moalic
Computing Wasserstein Barycenters via Linear Programming
355(9)
Gennaro Auricchio
Federico Bassetti
Stefano Gualandi
Marco Veneroni
Repairing Learned Controllers with Convex Optimization: A Case Study
364(10)
Dario Guidotti
Francesco Leofante
Claudia Castellini
Armando Tacchella
A Hybrid Approach for Exact Coloring of Massive Graphs
374(17)
Emmanuel Hebrard
George Katsirelos
Modelling and Solving the Minimum Shift Design Problem
391(18)
Lucas Kletzander
Nysret Musliu
A Computational Comparison of Optimization Methods for the Golomb Ruler Problem
409(17)
Burak Kocuk
Willem-Jan van Hoeve
A New CP-Approach for a Parallel Machine Scheduling Problem with Time Constraints on Machine Qualifications
426(17)
Arnaud Malapert
Margaux Nattaf
Efficient Solution Methods for the Cumulative-Interference Channel Assignment Problem Using Integer Optimization and Constraint Programming
443(18)
Paul J. Nicholas
Karla L. Hoffman
Heat Exchanger Circuitry Design by Decision Diagrams
461(11)
Nikolaos Ploskas
Christopher Laughman
Arvind U. Raghunathan
Nikolaos V. Sahinidis
Column Generation for Real-Time Ride-Sharing Operations
472(16)
Connor Riley
Antoine Legrain
Pascal Van Hentenryck
Some Experiments with Submodular Function Maximization via Integer Programming
488(14)
Domenico Salvagnin
Metric Hybrid Factored Planning in Nonlinear Domains with Constraint Generation
502(17)
Buser Say
Scott Sanner
Last-Mile Scheduling Under Uncertainty
519(10)
Thiago Serra
Arvind J. Raghunathan
David Bergman
John Hooker
Shingo Kobori
Building Optimal Steiner Trees on Supercomputers by Using up to 43,000 Cores
529(11)
Yuji Shinano
Daniel Rehfeldt
Thorsten Koch
Deep Inverse Optimization
540(17)
Yingcong Tan
Andrew Delong
Daria Terekhov
A Study on the Traveling Salesman Problem with a Drone
557(8)
Ziye Tang
Willem-Jan van Hoeve
Paul Shaw
Lower Bounds for Uniform Machine Scheduling Using Decision Diagrams
565(16)
Pim van den Bogaerdt
Mathijs de Weerdl
Extending Compact-Diagram to Basic Smart Multi-Valued Variable Diagrams
581(18)
Helene Verhaeghe
Christophe Lecoutre
Pierre Schaus
Arc Consistency Revisited
599(17)
Ruiwei Wang
Roland H. C. Yap
Embedding Decision Diagrams into Generative Adversarial Networks
616(17)
Yexiang Xue
Willem-Jan van Hoeve
Time Table Edge Finding with Energy Variables
633(10)
Moli Yang
Andreas Schutt
Peter J. Stuckey
Quadratic Reformulation of Nonlinear Pseudo-Boolean Functions via the Constraint Composite Graph
643(18)
Ka Wa Yip
Hong Xu
Sven Koenig
T. K. Satish Kumar
Author Index 661