Integration of Constraint Programming, Artificial Intelligence, and Operations Research: 21st International Conference, CPAIOR 2024, Uppsala, Sweden, May 28–31, 2024, Proceedings, Part I: Lecture Notes in Computer Science, cartea 14742
Editat de Bistra Dilkinaen Limba Engleză Paperback – 28 mai 2024
The 33 full papers and the 9 short papers presented in the proceedings were carefully reviewed and selected from a total of 104 submissions.
The content of the papers focus on new techniques or applications in the area and foster the integration of techniques from different fields dealing with large and complex problems.
| Toate formatele și edițiile | Preț | Express |
|---|---|---|
| Paperback (2) | 786.34 lei 6-8 săpt. | |
| Springer Nature Switzerland – 28 mai 2024 | 786.34 lei 6-8 săpt. | |
| Springer Nature Switzerland – 28 mai 2024 | 897.14 lei 6-8 săpt. |
Din seria Lecture Notes in Computer Science
- 20%
Preț: 426.75 lei - 20%
Preț: 315.62 lei - 20%
Preț: 320.92 lei - 15%
Preț: 426.53 lei - 20%
Preț: 313.87 lei - 20%
Preț: 355.79 lei - 20%
Preț: 355.54 lei - 20%
Preț: 355.18 lei - 20%
Preț: 390.68 lei - 20%
Preț: 392.03 lei - 20%
Preț: 498.95 lei - 20%
Preț: 390.79 lei - 20%
Preț: 495.44 lei - 20%
Preț: 498.80 lei - 20%
Preț: 498.50 lei - 20%
Preț: 355.93 lei - 20%
Preț: 639.52 lei - 20%
Preț: 499.90 lei - 20%
Preț: 498.95 lei - 20%
Preț: 390.42 lei - 20%
Preț: 326.81 lei - 20%
Preț: 391.36 lei - 20%
Preț: 321.68 lei - 20%
Preț: 498.90 lei - 20%
Preț: 312.82 lei - 20%
Preț: 496.73 lei - 20%
Preț: 320.72 lei - 20%
Preț: 497.25 lei - 15%
Preț: 496.40 lei - 20%
Preț: 324.19 lei - 20%
Preț: 498.80 lei - 20%
Preț: 461.86 lei - 20%
Preț: 355.59 lei -
Preț: 418.19 lei - 20%
Preț: 498.59 lei - 20%
Preț: 391.28 lei - 20%
Preț: 355.69 lei - 15%
Preț: 499.72 lei - 20%
Preț: 499.40 lei - 20%
Preț: 458.84 lei - 20%
Preț: 390.42 lei - 20%
Preț: 270.68 lei - 20%
Preț: 497.75 lei - 20%
Preț: 423.78 lei - 20%
Preț: 322.32 lei - 20%
Preț: 322.09 lei - 20%
Preț: 427.09 lei - 20%
Preț: 499.90 lei - 20%
Preț: 463.03 lei
Preț: 897.14 lei
Preț vechi: 1121.42 lei
-20% Nou
Puncte Express: 1346
Preț estimativ în valută:
158.73€ • 185.20$ • 138.77£
158.73€ • 185.20$ • 138.77£
Carte tipărită la comandă
Livrare economică 16-30 ianuarie 26
Preluare comenzi: 021 569.72.76
Specificații
ISBN-13: 9783031605963
ISBN-10: 3031605969
Pagini: 350
Ilustrații: XIV, 349 p. 79 illus., 68 illus. in color.
Dimensiuni: 155 x 235 mm
Greutate: 0.51 kg
Ediția:2024
Editura: Springer Nature Switzerland
Colecția Springer
Seria Lecture Notes in Computer Science
Locul publicării:Cham, Switzerland
ISBN-10: 3031605969
Pagini: 350
Ilustrații: XIV, 349 p. 79 illus., 68 illus. in color.
Dimensiuni: 155 x 235 mm
Greutate: 0.51 kg
Ediția:2024
Editura: Springer Nature Switzerland
Colecția Springer
Seria Lecture Notes in Computer Science
Locul publicării:Cham, Switzerland
Cuprins
Online optimization of a dial-a-ride problem with the integral primal simplex.- A Constraint Programming Model for the Electric Bus Assignment Problem with Parking Constraints.- Acquiring Constraints for a Non-linear Transmission Maintenance Scheduling Problem.- Effciently Mining Closed Interval Patterns with Constraint Programming.- Local Alterations of the Lagrange Multipliers for Enhancing the Filtering of the AtMostNValue.- Single Constant Multiplication for SAT.- Towards a Generic Representation of Combinatorial.- Problems for Learning-Based Approaches.- Accelerating Continuous Variable Coherent Ising Machines via Momentum.- Decision-focused predictions via pessimistic bilevel optimization: a computational study.- Bi-Objective Discrete Graphical Model Optimization.- An Exploration of Exact Methods for Effective Network Failure Detection and Diagnosis.- UNSAT Solver Synthesis via Monte Carlo Forest Search.- A hybrid approach integrating Generalized Arc Consistency and Differential Evolution for global optimization.- Assessing Group Fairness with Social Welfare Optimization.- Modeling and Exploiting Dominance Rules for Discrete Optimization with Decision Diagrams.- ViolationLS: Constraint-Based Local Search in CP-SAT.- ULD Build-Up Scheduling with Logic-Based Benders Decomposition.- A decomposition approach for a capacitated multi-vehicle covering tour problem with intermediate facilities.- Don’t Explain Noise: Robust Counterfactuals for Randomized Ensembles.- Certifying MIP-based Presolve Reductions for 0-1 Integer Linear Programs.- Learning to Solve Job Shop Scheduling under Uncertainty.