|
|
|
|
| LEADER |
02974nmm a2200397 u 4500 |
| 001 |
EB000376143 |
| 003 |
EBX01000000000000000229195 |
| 005 |
00000000000000.0 |
| 007 |
cr||||||||||||||||||||| |
| 008 |
130626 ||| eng |
| 020 |
|
|
|a 9783540343073
|
| 100 |
1 |
|
|a Beck, J. Christopher
|e [editor]
|
| 245 |
0 |
0 |
|a Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems
|h Elektronische Ressource
|b Third International Conference, CPAIOR 2006, Cork, Ireland, May 31 - June 2, 2006, Proceedings
|c edited by J. Christopher Beck, Barbara Smith
|
| 250 |
|
|
|a 1st ed. 2006
|
| 260 |
|
|
|a Berlin, Heidelberg
|b Springer Berlin Heidelberg
|c 2006, 2006
|
| 300 |
|
|
|a X, 301 p
|b online resource
|
| 505 |
0 |
|
|a Invited 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
|
| 653 |
|
|
|a Operations research
|
| 653 |
|
|
|a Software engineering
|
| 653 |
|
|
|a Computer science / Mathematics
|
| 653 |
|
|
|a Numerical Analysis
|
| 653 |
|
|
|a Discrete Mathematics in Computer Science
|
| 653 |
|
|
|a Artificial Intelligence
|
| 653 |
|
|
|a Software Engineering
|
| 653 |
|
|
|a Algorithms
|
| 653 |
|
|
|a Artificial intelligence
|
| 653 |
|
|
|a Numerical analysis
|
| 653 |
|
|
|a Discrete mathematics
|
| 653 |
|
|
|a Operations Research and Decision Theory
|
| 700 |
1 |
|
|a Smith, Barbara
|e [editor]
|
| 041 |
0 |
7 |
|a eng
|2 ISO 639-2
|
| 989 |
|
|
|b Springer
|a Springer eBooks 2005-
|
| 490 |
0 |
|
|a Theoretical Computer Science and General Issues
|
| 028 |
5 |
0 |
|a 10.1007/11757375
|
| 856 |
4 |
0 |
|u https://doi.org/10.1007/11757375?nosfx=y
|x Verlag
|3 Volltext
|
| 082 |
0 |
|
|a 005.1
|