SAT-Based Branch & Bound and Optimal Control of Hybrid Dynamical Systems-Reference-Cited by-同舟云学术

SAT-Based Branch & Bound and Optimal Control of Hybrid Dynamical Systems

Published:2004 Issue: Volume: Page:96-111
ISSN:0302-9743
Container-title:Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems
language:
Short-container-title:

Author:

Bemporad Alberto,Giorgetti Nicolò

Publisher

Springer Berlin Heidelberg

Link

http://link.springer.com/content/pdf/10.1007/978-3-540-24664-0_7.pdf

Reference23 articles.

1. Marriot, K., Stuckey, P.J.: Programming with constraints: an introduction. MIT Press, Cambridge (1998)

2. Gu, J., Purdom, P.W., Franco, J., Wah, B.: Algorithms for the satisfiability (SAT) problem: A survey. In: DIMACS Series on Discrete Mathematics and Theoretical Computer Science, vol. 35, pp. 19–151. American Mathematical Society, Providence (1997)

3. Hooker, J.: Logic-based methods for Optimization. Wiley-Interscience Series (2000)

4. Bockmayr, A., Kasper, T.: Branch and infer: A unifying framework for integer and finite domain constraint programming. INFORMS Journal on Computing 10(3), 287–300 (1998)

5. Rodosek, R., Wallace, M., Hajian, M.: A new approach to integrating mixed integer programming and constraint logic programming. Annals of Oper. Res. 86, 63–87 (1997)

Cited by 2 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. Optimal Control of Hybrid Systems by Logic-Based Benders Decomposition;IFAC Proceedings Volumes;2009

2. A SAT-Based Decision Procedure for Mixed Logical/Integer Linear Problems;Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems;2005