A new method for the global solution of large systems of continuous constraints

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 2861, Issue , 2003, Pages 142-156

  Boddy, Mark S ^a   Johnson, Daniel P ^b  

^a Adventium Labs   (United States)

^b HONEYWELL TECHNOLOGY CENTER   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

ARTIFICIAL INTELLIGENCE; COMPUTER SCIENCE; COMPUTERS;

CONSTRAINT ENVELOPES; CONSTRAINT EQUATION; CONTINUOUS CONSTRAINTS; GLOBAL FEASIBILITY; GLOBAL SOLUTIONS; HARD HYBRID PROBLEMS; QUADRATIC CONSTRAINT; SCHEDULING SYSTEMS;

SCHEDULING;

EID: 0242543462     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-540-39901-8_11     Document Type: Article

References (14)

1. Boddy, M., Carciofini, J., and Hadden, G.: Scheduling with Partial Orders and a Causal Model, Proceedings of the Space Applications and Research Workshop, Johnson Space Flight Center, August 1992
2. Boddy, M., and Goldman, R.: Empirical Results on Scheduling and Dynamic Backtracking, Proceedings of the International Symposium on Artificial Intelligence, Robotics, and Automation for Space, Pacadena, CA, 1994
3. Boddy, M., White, J., Goldman, R., and Short, N.: Integrated Planning and Scheduling for Earth Science Data Processing, Hostetter, Carl F., (Ed.), Proceedings of the 1995 Goddard Conference on Space Applications of Artificial Intelligence and Emerging Information Technologies, NASA Conference Publication 3296, 1995, 91-101
4. Boddy, M., and Krebsbach, K.: Hybrid Reasoning for Complex Systems, 1997 Fall Symposium on Model-directed Autonomous Systems
5. Cucker, F., and Smale, S.: Complexity Estimates Depending on Condition Number and Round-off Error, Jour. of the Assoc. of Computing Machinery, Vol 46 (1999) 113-184
6. Goldman, R., and Boddy, M.: Constraint-Based Scheduling for Batch Manufacturing, IEEE Expert, 1997
7. Heipcke, S.: Combined Modeling and Problem Solving in Mathematical Programming and Constraint Programming, PhD Thesis, School of Business, University of Buckingham, 1999
8. Hooker, J.: Logic-Based Methods for Optimization: Combining Optimization and Constraint Satisfaction, Wiley, John & Sons, 2000
9. Jansson, C.: Rigorous Error Bounds for the Optimal Value of Linear Programming Problems, Cocos '02, Global Constrained Optimization and Constraint Satisfaction, October 2-4, 2002
10. Kearfott, R.: Rigorous Global Search: Continuous Problems, Kluwer Academic Publishers, 1996
11. Lee, S., and Grossmann, I.: New Algorithms for Nonlinear Generalized Disjunctive Programming, Computers and Chem. Engng., 24(9-10), 2125-2141, 2000
12. Moore, R.,: Methods and Applications of Interval Analysis, by Ramon E. Moore, Society for Industrial & Applied Mathematics, Philadelphia, 1979
13. Smith, B., Brailsford, S., Hubbard, P., and Williams, H.: The Progressive Party Problem: Integer Linear Programming and Constraint Programming Compared, Working Notes of the Joint Workshop on Artificial Intelligence and Operations Research, Timberline, OR, 1995
14. Van Hentenryck, P., McAllister, D., and Kapur, D.: Solving Polynomial Systems Using a Branch and Prune Approach, SIAM Journal on Numerical Analysis, 34(2), 1997