rdf-syntax-grammar
mods:
  schema location: http://www.loc.gov/mods/v3 http://www.loc.gov/standards/mods/v3/mods-3-2.xsd
  title info:
    title: Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems
    sub title: 5th International Conference, CPAIOR 2008 Paris, France, May 20-23, 2008 Proceedings
  name:
    name part: Perron, Laurent.
    role:
      role term: editor.
  name:
    name part: Trick, Michael A.
    role:
      role term: editor.
  name:
    name part: SpringerLink (Online service)
  type of resource: text
  origin info:
    place:
      place term: gw
    date issued: 2008
    issuance: monographic
  language:
    language term: eng
  physical description:
    form: electronic
    form: electronic resource
    reformatting quality: access
    form: remote
    extent: XII, 394 p. online resource.
  abstract: The 5th International Conference on Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems (CPAIOR 2008) was held in Paris, France May 20–23, 2008. The purpose of this conference series is to bring together researchers in the ?elds of constraint programming, arti?cial intelligence, and operations research to explore ways of solving large-scale, practical optimization problems through integration and hybridization of the ?elds’ di?erent techniques. Through the years, this research community is discovering that the ?elds have much in c- mon, and there has been tremendous richness in the resulting cross-fertilization of ?elds. This year, we allowed submissions of both long (15 page) and short (5 page) papers, with short papers either being original work, a reduced version of a long paper, or an extended abstract of work published elsewhere. We were not s- prised by the 69 submissions in the long paper category: this is an active ?eld with many researchers. We were surprised by the 61 short paper submissions. This was far more than predicted. With 130 high-quality submissions, compe- tion for acceptance in this year’s program was particularly ?erce. In the end, we accepted 18 long papers and 22 short papers for presentation and publication in this volume.
  table of contents: Invited Talks -- Airline Scheduling: Accomplishments, Opportunities and Challenges -- Selected Challenges from Distribution and Commerce in the Airline and Travel Industry -- 30 Years of Constraint Programming -- Long Papers -- Constraint Integer Programming: A New Approach to Integrate CP and MIP -- New Filtering for the Constraint in the Context of Non-Overlapping Rectangles -- Multi-stage Benders Decomposition for Optimizing Multicore Architectures -- Fast and Scalable Domino Portrait Generation -- Gap Reduction Techniques for Online Stochastic Project Scheduling -- Integrating Symmetry, Dominance, and Bound-and-Bound in a Multiple Knapsack Solver -- Cost Propagation – Numerical Propagation for Optimization Problems -- Fitness-Distance Correlation and Solution-Guided Multi-point Constructive Search for CSPs -- Leveraging Belief Propagation, Backtrack Search, and Statistics for Model Counting -- The Accuracy of Search Heuristics: An Empirical Study on Knapsack Problems -- A Novel Approach For Detecting Symmetries in CSP Models -- Amsaa: A Multistep Anticipatory Algorithm for Online Stochastic Combinatorial Optimization -- Optimal Deployment of Eventually-Serializable Data Services -- Counting Solutions of Knapsack Constraints -- From High-Level Model to Branch-and-Price Solution in G12 -- Simpler and Incremental Consistency Checking and Arc Consistency Filtering Algorithms for the Weighted Spanning Tree Constraint -- Stochastic Satisfiability Modulo Theories for Non-linear Arithmetic -- A Hybrid Constraint Programming / Local Search Approach to the Job-Shop Scheduling Problem -- Short Papers -- Counting Solutions of Integer Programs Using Unrestricted Subtree Detection -- Rapidly Solving an Online Sequence of Maximum Flow Problems with Extensions to Computing Robust Minimum Cuts -- A Hybrid Approach for Solving Shift-Selection and Task-Sequencing Problems -- Solving a Log-Truck Scheduling Problem with Constraint Programming -- Using Local Search to Speed Up Filter…
  note: edited by Laurent Perron, Michael A. Trick.
  subject:
    topic: Computer science
  subject:
    topic: Operations research
  subject:
    topic: Decision making
  subject:
    topic: Computers
  subject:
    topic: Algorithms
  subject:
    topic: Numerical analysis
  subject:
    topic: Computer science
    topic: Mathematics
  subject:
    topic: Artificial intelligence
  subject:
    topic: Computer Science
  subject:
    topic: Theory of Computation
  subject:
    topic: Numeric Computing
  subject:
    topic: Discrete Mathematics in Computer Science
  subject:
    topic: Algorithm Analysis and Problem Complexity
  subject:
    topic: Artificial Intelligence (incl. Robotics)
  subject:
    topic: Operation Research/Decision Theory
  classification: QA75.5-76.95
  classification: 004.0151
  related item:
    title info:
      title: Springer eBooks
  related item:
    title info:
      title: Lecture Notes in Computer Science, 5015
  identifier: 9783540681557
  identifier: http://dx.doi.org/10.1007/978-3-540-68155-7
  record info:
    record creation date: 100301
    record change date: 20151204181351.0
    record identifier: 978-3-540-68155-7