|
|
|
|
|
|
|
|
1. |
Record Nr. |
UNINA9910484528903321 |
|
|
Titolo |
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 / / Andrea Lodi, Michela Milano, Paolo Toth, (eds.) |
|
|
|
|
|
|
|
Pubbl/distr/stampa |
|
|
New York, : Springer, 2010 |
|
|
|
|
|
|
|
ISBN |
|
1-280-38701-7 |
9786613564931 |
3-642-13520-X |
|
|
|
|
|
|
|
|
Edizione |
[1st ed.] |
|
|
|
|
|
Descrizione fisica |
|
1 online resource (XI, 369 p. 70 illus.) |
|
|
|
|
|
|
Collana |
|
Lecture notes in computer science, , 0302-9743 ; ; 6140 |
LNCS sublibrary. SL 1, Theoretical computer science and general issues |
|
|
|
|
|
|
|
|
Altri autori (Persone) |
|
LodiAndrea |
MilanoMichela |
TothPaolo |
|
|
|
|
|
|
|
|
Disciplina |
|
|
|
|
|
|
Soggetti |
|
Constraints (Artificial intelligence) |
Constraint programming (Computer science) |
Combinatorial optimization |
Artificial intelligence |
Operations research |
|
|
|
|
|
|
|
|
Lingua di pubblicazione |
|
|
|
|
|
|
Formato |
Materiale a stampa |
|
|
|
|
|
Livello bibliografico |
Monografia |
|
|
|
|
|
Note generali |
|
Bibliographic Level Mode of Issuance: Monograph |
|
|
|
|
|
|
Nota di bibliografia |
|
Includes bibliographical references and index. |
|
|
|
|
|
|
Nota di contenuto |
|
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 |
|
|
|
|