000 03955nam a22006255i 4500
001 978-3-540-34307-3
003 DE-He213
005 20240730173425.0
007 cr nn 008mamaa
008 100301s2006 gw | s |||| 0|eng d
020 _a9783540343073
_9978-3-540-34307-3
024 7 _a10.1007/11757375
_2doi
050 4 _aQA76.758
072 7 _aUMZ
_2bicssc
072 7 _aCOM051230
_2bisacsh
072 7 _aUMZ
_2thema
082 0 4 _a005.1
_223
245 1 0 _aIntegration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems
_h[electronic resource] :
_bThird International Conference, CPAIOR 2006, Cork, Ireland, May 31 - June 2, 2006, Proceedings /
_cedited by J. Christopher Beck, Barbara Smith.
250 _a1st ed. 2006.
264 1 _aBerlin, Heidelberg :
_bSpringer Berlin Heidelberg :
_bImprint: Springer,
_c2006.
300 _aX, 301 p.
_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 ;
_v3990
505 0 _aInvited 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.
650 0 _aSoftware engineering.
_94138
650 0 _aNumerical analysis.
_94603
650 0 _aComputer science
_xMathematics.
_93866
650 0 _aDiscrete mathematics.
_912873
650 0 _aAlgorithms.
_93390
650 0 _aArtificial intelligence.
_93407
650 0 _aOperations research.
_912218
650 1 4 _aSoftware Engineering.
_94138
650 2 4 _aNumerical Analysis.
_94603
650 2 4 _aDiscrete Mathematics in Computer Science.
_931837
650 2 4 _aAlgorithms.
_93390
650 2 4 _aArtificial Intelligence.
_93407
650 2 4 _aOperations Research and Decision Theory.
_931599
700 1 _aBeck, J. Christopher.
_eeditor.
_4edt
_4http://id.loc.gov/vocabulary/relators/edt
_9108278
700 1 _aSmith, Barbara.
_eeditor.
_4edt
_4http://id.loc.gov/vocabulary/relators/edt
_9108279
710 2 _aSpringerLink (Online service)
_9108280
773 0 _tSpringer Nature eBook
776 0 8 _iPrinted edition:
_z9783540343066
776 0 8 _iPrinted edition:
_z9783540824121
830 0 _aTheoretical Computer Science and General Issues,
_x2512-2029 ;
_v3990
_9108281
856 4 0 _uhttps://doi.org/10.1007/11757375
912 _aZDB-2-SCS
912 _aZDB-2-SXCS
912 _aZDB-2-LNC
942 _cELN
999 _c88919
_d88919