Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems: 7th International Conference, CPAIOR 2010, Bolo - nouveau livre

EAN (ISBN-13): 9783642135194
ISBN (ISBN-10): 3642135196
Version reliée
Livre de poche
Date de parution: 2010
Editeur: Springer Berlin Heidelberg Core >1
368 Pages
Poids: 0,571 kg
Langue: eng/Englisch

Livre dans la base de données depuis 2007-12-23T10:27:24+01:00 (Paris)
Page de détail modifiée en dernier sur 2023-12-27T17:03:00+01:00 (Paris)
ISBN/EAN: 9783642135194

ISBN - Autres types d'écriture:
3-642-13519-6, 978-3-642-13519-4
Autres types d'écriture et termes associés:
Auteur du livre: lodi, milano, tot, milan, mila, andre toth, andre michel, peter held, peter grant
Titre du livre: integration techniques, international optimization, com programming, combinatorial integration optimization, bologna, bolo bolo, lodi 2010, constraint programming

---

Données de l'éditeur

Auteur: Andrea Lodi; Michela Milano; Paolo Toth
Titre: Lecture Notes in Computer Science; Theoretical Computer Science and General Issues; Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems - 7th International Conference, CPAIOR 2010, Bologna, Italy, June 14-18, 2010, Proceedings
Editeur: Springer; Springer Berlin
369 Pages
Date de parution: 2010-06-01
Berlin; Heidelberg; DE
Langue: Anglais
53,49 € (DE)
54,99 € (AT)
59,00 CHF (CH)
Available
XI, 369 p. 70 illus.

BC; Hardcover, Softcover / Informatik, EDV/Informatik; Künstliche Intelligenz; Verstehen; applications; artificial intelligence; combinatorial optimization; cutting planes; heuristic search; network flows; operations research; optimization; project scheduling; software platform; variable selection; algorithm analysis and problem complexity; Artificial Intelligence; Discrete Mathematics; Theory of Computation; Numerical Analysis; Discrete Mathematics in Computer Science; Algorithms; Diskrete Mathematik; Theoretische Informatik; Numerische Mathematik; Mathematik für Informatiker; Algorithmen und Datenstrukturen; EA

Towards a MIP-Cut Metascheme.- Challenges for CPAIOR in Computational Sustainability.- Lazy Clause Generation: Combining the Power of SAT and CP (and MIP?) Solving.- On Matrices, Automata, and Double Counting.- The Increasing Nvalue Constraint.- Improving the Held and Karp Approach with Constraint Programming.- Characterization and Automation of Matching-Based Neighborhoods.- Rapid Learning for Binary Programs.- Hybrid Methods for the Multileaf Collimator Sequencing Problem.- Automatically Exploiting Subproblem Equivalence in Constraint Programming.- Single-Facility Scheduling over Long Time Horizons by Logic-Based Benders Decomposition.- Integrated Maintenance Scheduling for Semiconductor Manufacturing.- A Constraint Programming Approach for the Service Consolidation Problem.- Solving Connected Subgraph Problems in Wildlife Conservation.- Consistency Check for the Bin Packing Constraint Revisited.- A Relax-and-Cut Framework for Gomory’s Mixed-Integer Cuts.- An In-Out Approach to Disjunctive Optimization.- A SAT Encoding for Multi-dimensional Packing Problems.- Job Shop Scheduling with Setup Times and Maximal Time-Lags: A Simple Constraint Programming Approach.- On the Design of the Next Generation Access Networks.- Vehicle Routing for Food Rescue Programs: A Comparison of Different Approaches.- Constraint Programming and Combinatorial Optimisation in Numberjack.- Automated Configuration of Mixed Integer Programming Solvers.- Upper Bounds on the Number of Solutions of Binary Integer Programs.- Matrix Interdiction Problem.- Strong Combination of Ant Colony Optimization with Constraint Programming Optimization.- Service-Oriented Volunteer Computing for Massively Parallel Constraint Solving Using Portfolios.- Constraint Programming with Arbitrarily Large IntegerVariables.- Constraint-Based Local Search for Constrained Optimum Paths Problems.- Stochastic Constraint Programming by Neuroevolution with Filtering.- The Weighted Spanning Tree Constraint Revisited.- Constraint Reasoning with Uncertain Data Using CDF-Intervals.- Revisiting the Soft Global Cardinality Constraint.- A Constraint Integer Programming Approach for Resource-Constrained Project Scheduling.- Strategic Planning for Disaster Recovery with Stochastic Last Mile Distribution.- Massively Parallel Constraint Programming for Supercomputers: Challenges and Initial Results.- Boosting Set Constraint Propagation for Network Design.- More Robust Counting-Based Search Heuristics with Alldifferent Constraints.