Vai al contenuto principale della pagina
| Titolo: |
Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems [[electronic resource] ] : Third International Conference, CPAIOR 2006, Cork, Ireland, May 31 - June 2, 2006, Proceedings / / edited by J. Christopher Beck, Barbara Smith
|
| Pubblicazione: | Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2006 |
| Edizione: | 1st ed. 2006. |
| Descrizione fisica: | 1 online resource (X, 301 p.) |
| Disciplina: | 006.3 |
| Soggetto topico: | Software engineering |
| Numerical analysis | |
| Computer science—Mathematics | |
| Discrete mathematics | |
| Algorithms | |
| Artificial intelligence | |
| Operations research | |
| Software Engineering | |
| Numerical Analysis | |
| Discrete Mathematics in Computer Science | |
| Artificial Intelligence | |
| Operations Research and Decision Theory | |
| Persona (resp. second.): | BeckJ. Christopher |
| SmithBarbara | |
| Note generali: | Bibliographic Level Mode of Issuance: Monograph |
| Nota di bibliografia: | Includes bibliographical references and index. |
| Nota di contenuto: | Invited Talks -- Opt Art -- Planning for Mixed Discrete Continuous Domains -- Duality in Optimization and Constraint Satisfaction -- Technical Papers -- A Totally Unimodular Description of the Consistent Value Polytope for Binary Constraint Programming -- Undirected Forest Constraints -- Allocation, Scheduling and Voltage Scaling on Energy Aware MPSoCs -- The Range Constraint: Algorithms and Implementation -- On the Separability of Subproblems in Benders Decompositions -- A Hybrid Column Generation and Constraint Programming Optimizer for the Tail Assignment Problem -- The Power of Semidefinite Programming Relaxations for MAX-SAT -- Expected-Case Analysis for Delayed Filtering -- Plan B: Uncertainty/Time Trade-Offs for Linear and Integer Programming -- Progressive Solutions: A Simple but Efficient Dominance Rule for Practical RCPSP -- AND/OR Branch-and-Bound Search for Pure 0/1 Integer Linear Programming Problems -- The Timetable Constrained Distance Minimization Problem -- Conflict-Directed A* Search for Soft Constraints -- Event-Driven Probabilistic Constraint Programming -- Online Stochastic Reservation Systems -- Traveling Tournament Scheduling: A Systematic Evaluation of Simulated Annealling -- Open Constraints in a Closed World -- Conditional Lexicographic Orders in Constraint Satisfaction Problems -- An Efficient Hybrid Strategy for Temporal Planning -- Improved Algorithm for the Soft Global Cardinality Constraint. |
| Titolo autorizzato: | Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems ![]() |
| ISBN: | 3-540-34307-5 |
| Formato: | Materiale a stampa |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione: | Inglese |
| Record Nr.: | 996465899503316 |
| Lo trovi qui: | Univ. di Salerno |
| Opac: | Controlla la disponibilità qui |