Titlebook: Integration of AI and OR Techniques in Constraint Programming; 11th International C Helmut Simonis Conference proceedings 2014 Springer Int

FLUSH

troponins

清洗

Disregarding Duration Uncertainty in Partial Order Schedules? Yes, We Can!,from a Project Graph by adding precedence constraints so that no resource conflict can arise, for any possible assignment of the activity durations. In this paper, we use a simulation approach to evaluate the expected makespan of a number of POSs, obtained by solving scheduling benchmarks via multip

分散

An Exact Branch and Bound Algorithm with Symmetry Breaking for the Maximum Balanced Induced Bicliqunduced biclique problem. We introduce a simple and effective symmetry breaking technique. Finally, we discuss one particular class of graphs where the algorithm’s bound is ineffective, and show how to detect this situation and fall back to a simpler but faster algorithm. Computational results on a s

倒轉(zhuǎn)

Domain k-Wise Consistency Made as Simple as Generalized Arc Consistency,ion Problems (CSPs). Developing simple and practical filtering algorithms based on consistencies stronger than GAC is a challenge for the CP community. In this paper, we propose to combine k-Wise Consistency (kWC) with GAC, where kWC states that every tuple in a constraint can be extended to every s

強(qiáng)化

Representative Encodings to Translate Finite CSPs into SAT,tances that should not only be effectively generated, but should also be efficiently processed by SAT solvers. In this paper we investigate hierarchical and hybrid encodings, focussing on two specific encodings: the ., already proposed albeit not thoroughly tested, and a new .. Compared to the . and

并置

SAT and Hybrid Models of the Car Sequencing Problem,e features of these models are crucial to improving the state of the art in this domain. For quickly finding solutions, advanced CP heuristics are important and good propagation (either by a specialized propagator or by a sophisticated SAT encoding that simulates one) is necessary. For proving infea

變色龍

Ascribe

蛛絲

Call-Based Dynamic Programming for the Precedence Constrained Line Traveling Salesman,istance between two cities is the absolute difference between their abscissae and a partial ordering is given on the set of cities. Such a problem is encountered on linear construction schemes for instance. Using key dominance properties and lower bounds, we design a call-based dynamic program able to solve instances with up to 450 cities.