Reformulating Combinatorial Optimization as Constraint Satisfaction
暂无分享，去创建一个
I am currently a third year graduate (PhD) student in the Computer Science Department of Stanford University working in the Artificial Intelligence areas of Planning, Scheduling, Diagnosis, Hybrid Systems and Constraint Satisfaction.
[1] Fillia Makedon,et al. Fast approximation algorithms for multicommodity flow problems , 1991, STOC '91.
[2] Richard Dearden,et al. The Oracular Constraints Method , 2002, SARA.
[3] P. Pandurang Nayak,et al. Back to the Future for Consistency-Based Trajectory Tracking , 2000, AAAI/IAAI.
[4] Éva Tardos,et al. Fast Approximation Algorithms for Fractional Packing and Covering Problems , 1995, Math. Oper. Res..