LEADER 01052nam a22002651i 4500 001 991003558009707536 005 20030904161034.0 008 031111s1972 sz a||||||||||||||||ger 035 $ab12442926-39ule_inst 035 $aARCHE-047621$9ExL 040 $aDip.to Lingue$bita$cA.t.i. Arché s.c.r.l. Pandora Sicilia s.r.l. 082 04$a831.1 100 1 $aSchwab, Ute$0199599 245 10$aArbeo laosa :$bphilologische Studien zum Hildebrandlied /$cUte Schwab 260 $aBern :$bFrancke,$c1972 300 $a134 p. :$bill. ;$c24 cm 440 0$aBasler Studien zur deutschen Sprache und Literatur ;$v45 650 4$aPoesia tedesca 907 $a.b12442926$b02-04-14$c13-11-03 912 $a991003558009707536 945 $aLE012 F.G. 1001$g1$i2012000065727$lle012$o-$pE0.00$q-$rl$s- $t0$u0$v0$w0$x0$y.i12869260$z13-11-03 945 $aLE012 F.G. 601$g2$i2012000061392$lle012$o-$pE0.00$q-$rl$s- $t0$u0$v0$w0$x0$y.i12869272$z13-11-03 996 $aArbeo laosa$9166340 997 $aUNISALENTO 998 $ale012$b13-11-03$cm$da $e-$fger$gsz $h0$i2 LEADER 01201nam 2200409 450 001 9910483109203321 005 20230630000242.0 010 $a3-030-62525-7 035 $a(CKB)4100000011763147 035 $a(MiAaPQ)EBC6478288 035 $a(EXLCZ)994100000011763147 100 $a20210323d2021 uy 0 101 0 $aeng 135 $aurcnu|||||||| 181 $ctxt$2rdacontent 182 $cc$2rdamedia 183 $acr$2rdacarrier 200 10$aBreach of contract $ean economic analysis of the efficient breach scenario /$fOliver Hofmann 210 1$aCham, Switzerland :$cSpringer,$d[2021] 210 4$d©2021 215 $a1 online resource (271 pages) $cillustrations 311 $a3-030-62524-9 606 $aCommon Contract Law 606 $aLaw and economics 606 $aBehavioral$xExperimental Economics 615 0$aCommon Contract Law. 615 0$aLaw and economics. 615 0$aBehavioral$xExperimental Economics. 676 $a016.37 700 $aHofmann$b Oliver$01226772 801 0$bMiAaPQ 801 1$bMiAaPQ 801 2$bMiAaPQ 906 $aBOOK 912 $a9910483109203321 996 $aBreach of contract$92848503 997 $aUNINA LEADER 07013nam 22008655 450 001 9910484528903321 005 20251226202518.0 010 $a1-280-38701-7 010 $a9786613564931 010 $a3-642-13520-X 024 7 $a10.1007/978-3-642-13520-0 035 $a(CKB)2670000000028956 035 $a(SSID)ssj0000446557 035 $a(PQKBManifestationID)11923939 035 $a(PQKBTitleCode)TC0000446557 035 $a(PQKBWorkID)10497896 035 $a(PQKB)10757349 035 $a(DE-He213)978-3-642-13520-0 035 $a(MiAaPQ)EBC3065415 035 $a(PPN)149063725 035 $a(BIP)30771393 035 $a(EXLCZ)992670000000028956 100 $a20100612d2010 u| 0 101 0 $aeng 135 $aurnn|008mamaa 181 $ctxt 182 $cc 183 $acr 200 10$aIntegration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems $e7th International Conference, CPAIOR 2010, Bologna, Italy, June 14-18, 2010, Proceedings /$fedited by Andrea Lodi, Michela Milano, Paolo Toth 205 $a1st ed. 2010. 210 1$aBerlin, Heidelberg :$cSpringer Berlin Heidelberg :$cImprint: Springer,$d2010. 215 $a1 online resource (XI, 369 p. 70 illus.) 225 1 $aTheoretical Computer Science and General Issues,$x2512-2029 ;$v6140 300 $aBibliographic Level Mode of Issuance: Monograph 311 08$a3-642-13519-6 320 $aIncludes bibliographical references and index. 327 $aTowards 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. 330 $aThe 7th International Conference on Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems (CPAIOR 2010) was held in Bologna, Italy, June 16-18, 2010. The conference is intended primarily as a forum to focus on the integration and hybridization of the approaches of constraint programming (CP), arti'cial intelligence (AI), and operations research (OR) technologies for solving lar- scale and complex real-life combinatorial optimization problems. CPAIOR is focused on both theoretical and practical, application-oriented contributions. The interest of the researchcommunity in this conference is witnessed by the highnumber ofhigh-qualitysubmissions receivedthis year,reaching39 long and 33 short papers. From these submissions, we chose 18 long and 17 short papers to be published in full in the proceedings. ThisvolumeincludesextendedabstractsoftheinvitedtalksgivenatCPAIOR. Namely, one by Matteo Fischetti (University of Padova) on cutting planes and their use within search methods; another by Carla Gomes (Cornell University) on the recently funded NSF "Expedition in Computing" grant on the topic of computationalsustainabilityandonthepotentialapplicationofhybridoptimi- tion approachesto this area;a third by Peter Stuckey (University of Melbourne) on the integration of SATis'ability solvers within constraint programming and integer programming solvers. 410 0$aTheoretical Computer Science and General Issues,$x2512-2029 ;$v6140 606 $aArtificial intelligence 606 $aDiscrete mathematics 606 $aComputer science 606 $aNumerical analysis 606 $aComputer science$xMathematics 606 $aAlgorithms 606 $aArtificial Intelligence 606 $aDiscrete Mathematics 606 $aTheory of Computation 606 $aNumerical Analysis 606 $aDiscrete Mathematics in Computer Science 606 $aAlgorithms 615 0$aArtificial intelligence. 615 0$aDiscrete mathematics. 615 0$aComputer science. 615 0$aNumerical analysis. 615 0$aComputer science$xMathematics. 615 0$aAlgorithms. 615 14$aArtificial Intelligence. 615 24$aDiscrete Mathematics. 615 24$aTheory of Computation. 615 24$aNumerical Analysis. 615 24$aDiscrete Mathematics in Computer Science. 615 24$aAlgorithms. 676 $a519.64 701 $aLodi$b Andrea$0127975 701 $aMilano$b Michela$065829 701 $aToth$b Paolo$014375 712 12$aInternational Conference on Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimisation Problems 801 0$bMiAaPQ 801 1$bMiAaPQ 801 2$bMiAaPQ 906 $aBOOK 912 $a9910484528903321 996 $aIntegration of AI and OR techniques in constraint programming for combinatorial optimization problems$94202562 997 $aUNINA