menu
{ "item_title" : "Integration of Constraint Programming, Artificial Intelligence, and Operations Research", "item_author" : [" Louis-Martin Rousseau", "Kostas Stergiou "], "item_description" : "Constraint Programming for Dynamic Symbolic Execution of JavaScript.- Sequential and Parallel Solution-Biased Search for Subgraph Algorithms.- Core-Boosted Linear Search for Incomplete MaxSAT solving.- Binary Decision Diagrams for Bin Packing with Minimum Color Fragmentation.- Local Rapid Learning for Integer Programs.- A Status Report on Conflict Analysis in Mixed Integer Nonlinear Programming.- Generating Compound Moves in Local Search by Hybridisation with Complete Search.- SAT Encodings of Pseudo-Boolean Constraints with At-Most-One Relations.- A Constraint Programming Approach to Electric Vehicle Routing with Time Windows.- A Sampling-free Anticipatory Algorithm for the Kidney Exchange Problem.- Evaluating Ising Processing Units with Integer Programming.- Using Cost-Based Solution Densities from TSP Relaxations to Solve Routing Problems.- A Counting-Based Approach to Scalable Micro-service Deployment.- An Optimization Approach to the Ordering Phase of an Attended Home Delivery Service.- Consistency for 0-1 Programming.- Prediction + Optimization for the Knapsack Problem.- The maximum weighted submatrix coverage problem: A CP approach.- Learning MILP Resolution Outcomes Before Reaching Time-Limit.- An Improved Subsumption Testing Algorithm for the Optimal-Size Sorting Network Problem.- Investigating Constraint Programming for Real-World Industrial Test Laboratory Scheduling.- An Approach to Robustness in the Stable Roommates Problem and its Comparison with the Stable Marriage Problem.- Optimality Clue for Graph Coloring Problem.- Computing Wasserstein Barycenters via Linear Programming.- Repairing Learned Controllers with Convex Optimization: a Case Study.- A Hybrid Approach for Exact Coloring of Massive Graphs.- Modelling and Solving the Minimum Shift Design Problem.- A Computational Comparison of Optimization Methods for the Golomb Ruler Problem.- A new CP-approach for a parallel machine scheduling problem with time constraints on machine qualifications.- Efficient Solution Methods for the Cumulative-Interference Channel Assignment Problem Using Integer Optimization and Constraint Programming.- Heat Exchanger Circuitry Design by Decision Diagrams.- A Column Generation for Online Ride-Sharing Services.- Some experiments with submodular function maximization via integer programming.- Metric Hybrid Factored Planning in Nonlinear Domains with Constraint Generation.- Last-Mile Scheduling Under Uncertainty.- Building Optimal Steiner Trees on Supercomputers by using up to 43,000 Cores.- Deep Inverse Optimization.- A Study on the Traveling Salesman Problem with a Drone.- Lower Bounds for Uniform Machine Scheduling Using Decision Diagrams.- Extending Compact-MDD to Basic Smart Multi-Valued Variable Diagrams.- Arc Consistency Revisited.- Embedding Decision Diagrams into Generative Adversarial Networks.- Time Table Edge Finding with Energy Variables.- Quadratic Reformulation of Nonlinear Pseudo-Boolean Functions via the Constraint Composite Graph.", "item_img_path" : "https://covers1.booksamillion.com/covers/bam/3/03/019/211/3030192113_b.jpg", "price_data" : { "retail_price" : "54.99", "online_price" : "54.99", "our_price" : "54.99", "club_price" : "54.99", "savings_pct" : "0", "savings_amt" : "0.00", "club_savings_pct" : "0", "club_savings_amt" : "0.00", "discount_pct" : "10", "store_price" : "" } }
Integration of Constraint Programming, Artificial Intelligence, and Operations Research|Louis-Martin Rousseau

Integration of Constraint Programming, Artificial Intelligence, and Operations Research : 16th International Conference, Cpaior 2019, Thessaloniki, Gre

local_shippingShip to Me
In Stock.
FREE Shipping for Club Members help

Overview

Constraint Programming for Dynamic Symbolic Execution of JavaScript.- Sequential and Parallel Solution-Biased Search for Subgraph Algorithms.- Core-Boosted Linear Search for Incomplete MaxSAT solving.- Binary Decision Diagrams for Bin Packing with Minimum Color Fragmentation.- Local Rapid Learning for Integer Programs.- A Status Report on Conflict Analysis in Mixed Integer Nonlinear Programming.- Generating Compound Moves in Local Search by Hybridisation with Complete Search.- SAT Encodings of Pseudo-Boolean Constraints with At-Most-One Relations.- A Constraint Programming Approach to Electric Vehicle Routing with Time Windows.- A Sampling-free Anticipatory Algorithm for the Kidney Exchange Problem.- Evaluating Ising Processing Units with Integer Programming.- Using Cost-Based Solution Densities from TSP Relaxations to Solve Routing Problems.- A Counting-Based Approach to Scalable Micro-service Deployment.- An Optimization Approach to the Ordering Phase of an Attended Home Delivery Service.- Consistency for 0-1 Programming.- Prediction + Optimization for the Knapsack Problem.- The maximum weighted submatrix coverage problem: A CP approach.- Learning MILP Resolution Outcomes Before Reaching Time-Limit.- An Improved Subsumption Testing Algorithm for the Optimal-Size Sorting Network Problem.- Investigating Constraint Programming for Real-World Industrial Test Laboratory Scheduling.- An Approach to Robustness in the Stable Roommates Problem and its Comparison with the Stable Marriage Problem.- Optimality Clue for Graph Coloring Problem.- Computing Wasserstein Barycenters via Linear Programming.- Repairing Learned Controllers with Convex Optimization: a Case Study.- A Hybrid Approach for Exact Coloring of Massive Graphs.- Modelling and Solving the Minimum Shift Design Problem.- A Computational Comparison of Optimization Methods for the Golomb Ruler Problem.- A new CP-approach for a parallel machine scheduling problem with time constraints on machine qualifications.- Efficient Solution Methods for the Cumulative-Interference Channel Assignment Problem Using Integer Optimization and Constraint Programming.- Heat Exchanger Circuitry Design by Decision Diagrams.- A Column Generation for Online Ride-Sharing Services.- Some experiments with submodular function maximization via integer programming.- Metric Hybrid Factored Planning in Nonlinear Domains with Constraint Generation.- Last-Mile Scheduling Under Uncertainty.- Building Optimal Steiner Trees on Supercomputers by using up to 43,000 Cores.- Deep Inverse Optimization.- A Study on the Traveling Salesman Problem with a Drone.- Lower Bounds for Uniform Machine Scheduling Using Decision Diagrams.- Extending Compact-MDD to Basic Smart Multi-Valued Variable Diagrams.- Arc Consistency Revisited.- Embedding Decision Diagrams into Generative Adversarial Networks.- Time Table Edge Finding with Energy Variables.- Quadratic Reformulation of Nonlinear Pseudo-Boolean Functions via the Constraint Composite Graph.


This item is Non-Returnable

Details

  • ISBN-13: 9783030192112
  • ISBN-10: 3030192113
  • Publisher: Springer
  • Publish Date: April 2019
  • Dimensions: 9.21 x 6.14 x 1.37 inches
  • Shipping Weight: 2.08 pounds
  • Page Count: 662

Related Categories

You May Also Like...

    1

BAM Customer Reviews