000 | 04963nam a22006375i 4500 | ||
---|---|---|---|
001 | 978-3-540-72397-4 | ||
003 | DE-He213 | ||
005 | 20240730193148.0 | ||
007 | cr nn 008mamaa | ||
008 | 100301s2007 gw | s |||| 0|eng d | ||
020 |
_a9783540723974 _9978-3-540-72397-4 |
||
024 | 7 |
_a10.1007/978-3-540-72397-4 _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] : _b4th International Conference, CPAIOR 2007, Brussels, Belgium, May 23-26, 2007, Proceedings / _cedited by Pascal Van Hentenryck, Laurence Wolsey. |
250 | _a1st ed. 2007. | ||
264 | 1 |
_aBerlin, Heidelberg : _bSpringer Berlin Heidelberg : _bImprint: Springer, _c2007. |
|
300 |
_aX, 391 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 ; _v4510 |
|
505 | 0 | _aMinimum Cardinality Matrix Decomposition into Consecutive-Ones Matrices: CP and IP Approaches -- Connections in Networks: Hardness of Feasibility Versus Optimality -- Modeling the Regular Constraint with Integer Programming -- Hybrid Local Search for Constrained Financial Portfolio Selection Problems -- The "Not-Too-Heavy Spanning Tree" Constraint -- Eliminating Redundant Clauses in SAT Instances -- Cost-Bounded Binary Decision Diagrams for 0-1 Programming -- YIELDS: A Yet Improved Limited Discrepancy Search for CSPs -- A Global Constraint for Total Weighted Completion Time -- Computing Tight Time Windows for RCPSPWET with the Primal-Dual Method -- Necessary Condition for Path Partitioning Constraints -- A Constraint Programming Approach to the Hospitals / Residents Problem -- Best-First AND/OR Search for 0/1 Integer Programming -- A Position-Based Propagator for the Open-Shop Problem -- Directional Interchangeability for Enhancing CSP Solving -- A Continuous Multi-resources cumulative Constraint with Positive-Negative Resource Consumption-Production -- Replenishment Planning for Stochastic Inventory Systems with Shortage Cost -- Preprocessing Expression-Based Constraint Satisfaction Problems for Stochastic Local Search -- The Deviation Constraint -- The Linear Programming Polytope of Binary Constraint Problems with Bounded Tree-Width -- On Boolean Functions Encodable as a Single Linear Pseudo-Boolean Constraint -- Solving a Stochastic Queueing Control Problem with Constraint Programming -- Constrained Clustering Via Concavity Cuts -- Bender's Cuts Guided Large Neighborhood Search for the Traveling Umpire Problem -- A Large Neighborhood Search Heuristic for Graph Coloring -- Generalizations of the Global Cardinality Constraint for Hierarchical Resources -- A Column Generation BasedDestructive Lower Bound for Resource Constrained Project Scheduling Problems. | |
520 | _aThis book constitutes the refereed proceedings of the 4th International Conference on Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems, CPAIOR 2007, held in Brussels, Belgium in May 2007. The 27 revised full papers presented were carefully reviewed and selected from 80 submissions. Methodological and foundational issues from AI, OR, and algorithmics are presented as well as applications to the solution of combinatorial optimization problems in various fields via constraint programming. | ||
650 | 0 |
_aArtificial intelligence. _93407 |
|
650 | 0 |
_aNumerical analysis. _94603 |
|
650 | 0 |
_aComputer science _xMathematics. _93866 |
|
650 | 0 |
_aDiscrete mathematics. _912873 |
|
650 | 0 |
_aAlgorithms. _93390 |
|
650 | 0 |
_aOperations research. _912218 |
|
650 | 1 | 4 |
_aArtificial Intelligence. _93407 |
650 | 2 | 4 |
_aNumerical Analysis. _94603 |
650 | 2 | 4 |
_aDiscrete Mathematics in Computer Science. _931837 |
650 | 2 | 4 |
_aAlgorithms. _93390 |
650 | 2 | 4 |
_aOperations Research and Decision Theory. _931599 |
650 | 2 | 4 |
_aDiscrete Mathematics. _912873 |
700 | 1 |
_aVan Hentenryck, Pascal. _eeditor. _4edt _4http://id.loc.gov/vocabulary/relators/edt _922302 |
|
700 | 1 |
_aWolsey, Laurence. _eeditor. _4edt _4http://id.loc.gov/vocabulary/relators/edt _9152709 |
|
710 | 2 |
_aSpringerLink (Online service) _9152710 |
|
773 | 0 | _tSpringer Nature eBook | |
776 | 0 | 8 |
_iPrinted edition: _z9783540723967 |
776 | 0 | 8 |
_iPrinted edition: _z9783540838074 |
830 | 0 |
_aTheoretical Computer Science and General Issues, _x2512-2029 ; _v4510 _9152711 |
|
856 | 4 | 0 | _uhttps://doi.org/10.1007/978-3-540-72397-4 |
912 | _aZDB-2-SCS | ||
912 | _aZDB-2-SXCS | ||
912 | _aZDB-2-LNC | ||
942 | _cELN | ||
999 |
_c94627 _d94627 |