You have Guest access.
Log In
Frédéric Benhamou
Front matter
1
Global Optimization of Probabilistically Constrained Linear Programs
2-14
Algorithms and Constraint Programming
15
Interval Analysis and Robotics
16-28
Constraint Based Resilience Analysis
29-43
Infinite Qualitative Simulations by Means of Constraint Programming
44-58
Algorithms for Stochastic CSPs
59-74
Graph Properties Based Filtering
75-90
The ROOTS Constraint
91-106
CoJava: Optimization Modeling by Nondeterministic Simulation
107-121
An Algebraic Characterisation of Complexity for Valued Constraint
122-136
Typed Guarded Decompositions for Constraint Satisfaction
137-151
Propagation in CSP and SAT
152-166
The Minimum Spanning Tree Constraint
167-181
Impact of Censored Sampling on the Performance of Restart Strategies
182-197
Watched Literals for Constraint Propagation in Minion
198-212
Inner and Outer Approximations of Existentially Quantified Equality Constraints
213-228
Performance Prediction and Automated Tuning of Randomized and Parametric Algorithms
229-243
Adaptive Clause Weight Redistribution
244-255
Localization of an Underwater Robot Using Interval Constraint Propagation
256-270
Approximability of Integer Programming with Generalised Constraints
271-283
When Constraint Programming and Local Search Solve the Scheduling Problem of Electricité de France Nuclear Power Plant Outages
284-298
Generalized Arc Consistency for Positive Table Constraints
299-313
Stochastic Allocation and Scheduling for Conditional Task Graphs in MPSoCs
314-328
Boosting Open CSPs
329-343
Compiling Constraint Networks into AND/OR Multi-valued Decision Diagrams (AOMDDs)
344-358
Distributed Constraint-Based Local Search
359-374
High-Level Nondeterministic Abstractions in C++
375-389
A Structural Characterization of Temporal Dynamic Controllability
390-405
When Interval Analysis Helps Inter-block Backtracking
406-420
Randomization in Constraint Programming for Airline Planning
421-436
Towards an Efficient SAT Encoding for Temporal Reasoning
437-452
Decomposition of Multi-operator Queries on Semiring-Based Graphical Models
453-467
Dynamic Lex Constraints
468-483
Generalizing AllDifferent: The SomeDifferent Constraint
484-498
Mini-bucket Elimination with Bucket Propagation
499-513
Constraint Satisfaction with Bounded Treewidth Revisited
514-529
Preprocessing QBF
530-544
The Theory of Grammar Constraints
545-559
Constraint Programming Models for Graceful Graphs
560-574
A Simple Distribution-Free Approach to the Max k-Armed Bandit Problem
575-589
Generating Propagators for Finite Set Constraints
590-603
Compiling Finite Linear CSP into SAT
604-619
Differentiable Invariants
620-634
Revisiting the Sequence Constraint
635-649
BlockSolve: A Bottom-Up Approach for Solving Quantified CSPs
650-664
General Symmetry Breaking Constraints
665-669
Inferring Variable Conflicts for Local Search
670-674
Reasoning by Dominance in Not-Equals Binary Constraint Networks
675-679
Distributed Stable Matching Problems with Ties and Incomplete Lists
680-684
Soft Arc Consistency Applied to Optimal Planning
685-689
A Note on Low Autocorrelation Binary Sequences
690-694
Relaxations and Explanations for Quantified Constraint Satisfaction Problems
695-699
Static and Dynamic Structural Symmetry Breaking
700-705
The Modelling Language Zinc
706-710
A Filter for the Circuit Constraint
711-715
A New Algorithm for Sampling CSP Solutions Uniformly at Random
716-720
Sports League Scheduling: Enumerative Search for Prob026 from CSPLib
721-725
Dynamic Symmetry Breaking Restarted
726-730
The Effect of Constraint Representation on Structural Tractability
731-735
Failure Analysis in Backtrack Search for Constraint Satisfaction
736-740
Heavy-Tailed Runtime Distributions: Heuristics, Models and Optimal Refutations
741-745
An Extension of Complexity Bounds and Dynamic Heuristics for Tree-Decompositions of CSP
746-750
Clique Inference Process for Solving Max-CSP
751-755
Global Grammar Constraints
756-760
Constraint Propagation for Domain Bounding in Distributed Task Scheduling
761-765
Interactive Distributed Configuration
766-771
Retroactive Ordering for Dynamic Backtracking
Back matter
This page requires script.
Frequently asked questions General info on journals and books Send us your feedback Impressum Contact us
© Springer, Part of Springer Science+Business Media Privacy, Disclaimer, Terms & Conditions, and Copyright Info