Pseudo-Boolean and Finite Domain Constraint Programming: A Case Study
暂无分享,去创建一个
[1] Alexander Bockmayr,et al. Finite Domain and Cutting Plane Techniques in CLP(PB) , 1995, ICLP.
[2] Egon Balas,et al. A lift-and-project cutting plane algorithm for mixed 0–1 programs , 1993, Math. Program..
[3] Alexander Bockmayr,et al. Cutting Planes in Constraint Logic Programming , 1994 .
[4] Alexander Bockmayr. Solving Pseudo-Boolean Constraints , 1994, Constraint Programming.
[5] Richard C. Larson,et al. Model Building in Mathematical Programming , 1979 .
[6] Alexander Bockmayr. Logic Programming with Pseudo-Boolean Constraints , 1991, WCLP.
[7] Pascal Van Hentenryck,et al. versus Specificity: an Experience with AI and , 1988 .
[8] Laurence A. Wolsey,et al. Integer and Combinatorial Optimization , 1988 .
[9] Pascal Van Hentenryck. Constraint satisfaction in logic programming , 1989, Logic programming.
[10] Pascal Van Hentenryck,et al. The Constraint Logic Programming Language CHIP , 1988, FGCS.
[11] John E. Beasley,et al. OR-Library: Distributing Test Problems by Electronic Mail , 1990 .