000 | 05128nam a22006375i 4500 | ||
---|---|---|---|
001 | 978-3-642-13520-0 | ||
003 | DE-He213 | ||
005 | 20240730195801.0 | ||
007 | cr nn 008mamaa | ||
008 | 100612s2010 gw | s |||| 0|eng d | ||
020 |
_a9783642135200 _9978-3-642-13520-0 |
||
024 | 7 |
_a10.1007/978-3-642-13520-0 _2doi |
|
050 | 4 | _aQ334-342 | |
050 | 4 | _aTA347.A78 | |
072 | 7 |
_aUYQ _2bicssc |
|
072 | 7 |
_aCOM004000 _2bisacsh |
|
072 | 7 |
_aUYQ _2thema |
|
082 | 0 | 4 |
_a006.3 _223 |
245 | 1 | 0 |
_aIntegration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems _h[electronic resource] : _b7th International Conference, CPAIOR 2010, Bologna, Italy, June 14-18, 2010, Proceedings / _cedited by Andrea Lodi, Michela Milano, Paolo Toth. |
250 | _a1st ed. 2010. | ||
264 | 1 |
_aBerlin, Heidelberg : _bSpringer Berlin Heidelberg : _bImprint: Springer, _c2010. |
|
300 |
_aXI, 369 p. 70 illus. _bonline resource. |
||
336 |
_atext _btxt _2rdacontent |
||
337 |
_acomputer _bc _2rdamedia |
||
338 |
_aonline resource _bcr _2rdacarrier |
||
347 |
_atext file _bPDF _2rda |
||
490 | 1 |
_aTheoretical Computer Science and General Issues, _x2512-2029 ; _v6140 |
|
505 | 0 | _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. | |
650 | 0 |
_aArtificial intelligence. _93407 |
|
650 | 0 |
_aDiscrete mathematics. _912873 |
|
650 | 0 |
_aComputer science. _99832 |
|
650 | 0 |
_aNumerical analysis. _94603 |
|
650 | 0 |
_aComputer science _xMathematics. _93866 |
|
650 | 0 |
_aAlgorithms. _93390 |
|
650 | 1 | 4 |
_aArtificial Intelligence. _93407 |
650 | 2 | 4 |
_aDiscrete Mathematics. _912873 |
650 | 2 | 4 |
_aTheory of Computation. _9161332 |
650 | 2 | 4 |
_aNumerical Analysis. _94603 |
650 | 2 | 4 |
_aDiscrete Mathematics in Computer Science. _931837 |
650 | 2 | 4 |
_aAlgorithms. _93390 |
700 | 1 |
_aLodi, Andrea. _eeditor. _4edt _4http://id.loc.gov/vocabulary/relators/edt _9161333 |
|
700 | 1 |
_aMilano, Michela. _eeditor. _4edt _4http://id.loc.gov/vocabulary/relators/edt _9161334 |
|
700 | 1 |
_aToth, Paolo. _eeditor. _4edt _4http://id.loc.gov/vocabulary/relators/edt _9161335 |
|
710 | 2 |
_aSpringerLink (Online service) _9161336 |
|
773 | 0 | _tSpringer Nature eBook | |
776 | 0 | 8 |
_iPrinted edition: _z9783642135194 |
776 | 0 | 8 |
_iPrinted edition: _z9783642135217 |
830 | 0 |
_aTheoretical Computer Science and General Issues, _x2512-2029 ; _v6140 _9161337 |
|
856 | 4 | 0 | _uhttps://doi.org/10.1007/978-3-642-13520-0 |
912 | _aZDB-2-SCS | ||
912 | _aZDB-2-SXCS | ||
912 | _aZDB-2-LNC | ||
942 | _cELN | ||
999 |
_c95777 _d95777 |