Atjaunināt sīkdatņu piekrišanu

E-grāmata: Integration of AI and OR Techniques in Constraint Programming: 11th International Conference, CPAIOR 2014, Cork, Ireland, May 19-23, 2014, Proceedings

Edited by
  • Formāts: PDF+DRM
  • Sērija : Lecture Notes in Computer Science 8451
  • Izdošanas datums: 12-May-2014
  • Izdevniecība: Springer International Publishing AG
  • Valoda: eng
  • ISBN-13: 9783319070469
Citas grāmatas par šo tēmu:
  • Formāts - PDF+DRM
  • Cena: 53,52 €*
  • * ši ir gala cena, t.i., netiek piemērotas nekādas papildus atlaides
  • Ielikt grozā
  • Pievienot vēlmju sarakstam
  • Šī e-grāmata paredzēta tikai personīgai lietošanai. E-grāmatas nav iespējams atgriezt un nauda par iegādātajām e-grāmatām netiek atmaksāta.
Integration of AI and OR Techniques in Constraint Programming: 11th International Conference, CPAIOR 2014, Cork, Ireland, May 19-23, 2014, ProceedingsPalielināt
  • Formāts: PDF+DRM
  • Sērija : Lecture Notes in Computer Science 8451
  • Izdošanas datums: 12-May-2014
  • Izdevniecība: Springer International Publishing AG
  • Valoda: eng
  • ISBN-13: 9783319070469
Citas grāmatas par šo tēmu:

DRM restrictions

  • Kopēšana (kopēt/ievietot):

    nav atļauts

  • Drukāšana:

    nav atļauts

  • Lietošana:

    Digitālo tiesību pārvaldība (Digital Rights Management (DRM))
    Izdevējs ir piegādājis šo grāmatu šifrētā veidā, kas nozīmē, ka jums ir jāinstalē bezmaksas programmatūra, lai to atbloķētu un lasītu. Lai lasītu šo e-grāmatu, jums ir jāizveido Adobe ID. Vairāk informācijas šeit. E-grāmatu var lasīt un lejupielādēt līdz 6 ierīcēm (vienam lietotājam ar vienu un to pašu Adobe ID).

    Nepieciešamā programmatūra
    Lai lasītu šo e-grāmatu mobilajā ierīcē (tālrunī vai planšetdatorā), jums būs jāinstalē šī bezmaksas lietotne: PocketBook Reader (iOS / Android)

    Lai lejupielādētu un lasītu šo e-grāmatu datorā vai Mac datorā, jums ir nepieciešamid Adobe Digital Editions (šī ir bezmaksas lietotne, kas īpaši izstrādāta e-grāmatām. Tā nav tas pats, kas Adobe Reader, kas, iespējams, jau ir jūsu datorā.)

    Jūs nevarat lasīt šo e-grāmatu, izmantojot Amazon Kindle.

This book constitutes the proceedings of the International Conference on the Integration of Artificial Intelligence (AI) and Operations Research (OR) Techniques in Constraint Programming, CPAIOR 2014, held in Cork, Ireland, in May 2014. The 33 papers presented in this volume were carefully reviewed and selected from 70 submissions. The papers focus on constraint programming and global constraints; scheduling modelling; encodings and SAT logistics; MIP; CSP and complexity; parallelism and search; and data mining and machine learning.
Call-Based Dynamic Programming for the Precedence Constrained Line
Traveling Salesman.- Stable Roommates and Constraint Programming.- Detecting
and Exploiting Permutation Structures in MIPs.- Solving the Quorumcast
Routing Problem as a Mixed Integer Program.- A New MIP Model for
Parallel-Batch Scheduling with Non-identical Job Sizes.- Mining (Soft-)
Skypatterns Using Dynamic CSP.- Modelling with Option Types in MiniZinc.-
Interactive Design of Sustainable Cities with a Distributed Local Search
Solver.- Sliced Table Constraints: Combining Compression and Tabular
Reduction.- The PrePack Optimization Problem.- An Integrated Constraint
Programming Approach to Scheduling Sports Leagues with Divisional and
Round-Robin Tournaments.- Local Search for a Cargo Assembly Planning
Problem.- A Logic Based Benders Approach to the Concrete Delivery Problem.-
Evaluating CP Techniques to Plan Dynamic Resource Provisioning in Distributed
Stream Processing.- Disregarding Duration Uncertainty in Partial Order
Schedules? Yes, We Can.- An Exact Branch and Bound Algorithm with Symmetry
Breaking for the Maximum Balanced Induced Biclique Problem.- Domain k-Wise
Consistency Made as Simple as Generalized Arc Consistency.- Representative
Encodings to Translate Finite CSPs into SAT.- SAT and Hybrid Models of the
Car Sequencing Problem.- Continuously Degrading Resource and Interval
Dependent Activity Durations in Nuclear Medicine Patient Scheduling.- Cost
Impact Guided LNS.- Proteus: A Hierarchical Portfolio of Solvers and
Transformations.- Buffered Resource Constraint: Algorithms and Complexity.-
Combining Discrete Ellipsoid-Based Search and Branch-and-Cut for Binary
Quadratic Programming Problems.- Parallel Combinatorial Optimization with
Decision Diagrams .- A Portfolio Approach to Enumerating Minimal Correction
Subsets for Satisfiability Problems.- Parallel Depth-Bounded Discrepancy
Search.- Self-splitting of Workload in Parallel Computation.- The Markov
Transition Constraint.- NewLower Bounds on the Number of Vehicles for the
Vehicle Routing Problem with Time Windows.- Constrained Clustering Using
Column Generation.- A Constraint Programming-Based Column Generation Approach
for Operating Room Planning and Scheduling.- Dynamic Controllability and
Dispatchability Relationships.
Biežāk uzdotie jautājumi par e-grāmatām Biežāk uzdotie jautājumi par e-grāmatām
Permanent link: https://www.kriso.lv/db/97833190704692e.html
Keywords: