↓ Skip to main content

Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems

Overview of attention for book
Cover of 'Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems'

Table of Contents

  1. Altmetric Badge
    Book Overview
  2. Altmetric Badge
    Chapter 1 Airline Scheduling: Accomplishments, Opportunities and Challenges
  3. Altmetric Badge
    Chapter 2 Selected Challenges from Distribution and Commerce in the Airline and Travel Industry
  4. Altmetric Badge
    Chapter 3 30 Years of Constraint Programming
  5. Altmetric Badge
    Chapter 4 Constraint Integer Programming: A New Approach to Integrate CP and MIP
  6. Altmetric Badge
    Chapter 5 New Filtering for the $\mathit{cumulative}$ Constraint in the Context of Non-Overlapping Rectangles
  7. Altmetric Badge
    Chapter 6 Multi-stage Benders Decomposition for Optimizing Multicore Architectures
  8. Altmetric Badge
    Chapter 7 Fast and Scalable Domino Portrait Generation
  9. Altmetric Badge
    Chapter 8 Gap Reduction Techniques for Online Stochastic Project Scheduling
  10. Altmetric Badge
    Chapter 9 Integrating Symmetry, Dominance, and Bound-and-Bound in a Multiple Knapsack Solver
  11. Altmetric Badge
    Chapter 10 Cost Propagation – Numerical Propagation for Optimization Problems
  12. Altmetric Badge
    Chapter 11 Fitness-Distance Correlation and Solution-Guided Multi-point Constructive Search for CSPs
  13. Altmetric Badge
    Chapter 12 Leveraging Belief Propagation, Backtrack Search, and Statistics for Model Counting
  14. Altmetric Badge
    Chapter 13 The Accuracy of Search Heuristics: An Empirical Study on Knapsack Problems
  15. Altmetric Badge
    Chapter 14 A Novel Approach For Detecting Symmetries in CSP Models
  16. Altmetric Badge
    Chapter 15 Amsaa: A Multistep Anticipatory Algorithm for Online Stochastic Combinatorial Optimization
  17. Altmetric Badge
    Chapter 16 Optimal Deployment of Eventually-Serializable Data Services
  18. Altmetric Badge
    Chapter 17 Counting Solutions of Knapsack Constraints
  19. Altmetric Badge
    Chapter 18 From High-Level Model to Branch-and-Price Solution in G12
  20. Altmetric Badge
    Chapter 19 Simpler and Incremental Consistency Checking and Arc Consistency Filtering Algorithms for the Weighted Spanning Tree Constraint
  21. Altmetric Badge
    Chapter 20 Stochastic Satisfiability Modulo Theories for Non-linear Arithmetic
  22. Altmetric Badge
    Chapter 21 A Hybrid Constraint Programming / Local Search Approach to the Job-Shop Scheduling Problem
  23. Altmetric Badge
    Chapter 22 Counting Solutions of Integer Programs Using Unrestricted Subtree Detection
  24. Altmetric Badge
    Chapter 23 Rapidly Solving an Online Sequence of Maximum Flow Problems with Extensions to Computing Robust Minimum Cuts
  25. Altmetric Badge
    Chapter 24 A Hybrid Approach for Solving Shift-Selection and Task-Sequencing Problems
  26. Altmetric Badge
    Chapter 25 Solving a Log-Truck Scheduling Problem with Constraint Programming
  27. Altmetric Badge
    Chapter 26 Using Local Search to Speed Up Filtering Algorithms for Some NP-Hard Constraints
  28. Altmetric Badge
    Chapter 27 Connections in Networks: A Hybrid Approach
  29. Altmetric Badge
    Chapter 28 Efficient Haplotype Inference with Combined CP and OR Techniques
  30. Altmetric Badge
    Chapter 29 Integration of CP and Compilation Techniques for Instruction Sequence Test Generation
  31. Altmetric Badge
    Chapter 30 Propagating Separable Equalities in an MDD Store
  32. Altmetric Badge
    Chapter 31 The Weighted Cfg Constraint
  33. Altmetric Badge
    Chapter 32 CP with ACO
  34. Altmetric Badge
    Chapter 33 A Combinatorial Auction Framework for Solving Decentralized Scheduling Problems (Extended Abstract)
  35. Altmetric Badge
    Chapter 34 Constraint Optimization and Abstraction for Embedded Intelligent Systems
  36. Altmetric Badge
    Chapter 35 A Parallel Macro Partitioning Framework for Solving Mixed Integer Programs
  37. Altmetric Badge
    Chapter 36 Guiding Stochastic Search by Dynamic Learning of the Problem Topography
  38. Altmetric Badge
    Chapter 37 Hybrid Variants for Iterative Flattening Search
  39. Altmetric Badge
    Chapter 38 Global Propagation of Practicability Constraints
  40. Altmetric Badge
    Chapter 39 The Polytope of Tree-Structured Binary Constraint Satisfaction Problems
  41. Altmetric Badge
    Chapter 40 A Tabu Search Method for Interval Constraints
  42. Altmetric Badge
    Chapter 41 The Steel Mill Slab Design Problem Revisited
  43. Altmetric Badge
    Chapter 42 Filtering Atmost1 on Pairs of Set Variables
  44. Altmetric Badge
    Chapter 43 Mobility Allowance Shuttle Transit (MAST) Services: MIP Formulation and Strengthening with Logic Constraints
Attention for Chapter 20: Stochastic Satisfiability Modulo Theories for Non-linear Arithmetic
Altmetric Badge

Citations

dimensions_citation
6 Dimensions

Readers on

mendeley
7 Mendeley
You are seeing a free-to-access but limited selection of the activity Altmetric has collected about this research output. Click here to find out more.
Chapter title
Stochastic Satisfiability Modulo Theories for Non-linear Arithmetic
Chapter number 20
Book title
Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems
Published by
Springer, Berlin, Heidelberg, May 2008
DOI 10.1007/978-3-540-68155-7_20
Book ISBNs
978-3-54-068154-0, 978-3-54-068155-7
Authors

Tino Teige, Martin Fränzle

Mendeley readers

The data shown below were compiled from readership statistics for 7 Mendeley readers of this research output. Click here to see the associated Mendeley record.

Geographical breakdown

Country Count As %
India 1 14%
Unknown 6 86%

Demographic breakdown

Readers by professional status Count As %
Professor 2 29%
Other 2 29%
Student > Ph. D. Student 2 29%
Unspecified 1 14%
Readers by discipline Count As %
Computer Science 6 86%
Unspecified 1 14%