THE UNIVERSITY OF MICHIGAN
Department of Mechanical Engineering

ME 558: Discrete Design Optimization

Home

Schedule
Course notes
Problem sets
Project info
References
Past due policy

 

 

horizontal rule

The references below are generally categorized, although most books cover multiple topics as noted at each title. Bolded are the topics I referred to when developing the course notes. I am constantly in search of easy-to-understand references (that's the primal  criterion!) to help you learn the topics -- please email kazu@umich.edu if you know good books!

Fundamentals

bulletK. Rosen, Discrete Mathematics and Its Applications , Forth edition, McGraw Hill, 1999 --- sets, graphs.

Integer programming

bulletL. Wolsey, Integer Programming, Wiley, 1998 --- integer programming, heuristics, complexity theory.
bulletC. Papadimitriou and K. Steiglitz, Combinatorial Optimization, Dover, 1998 --- linear programming, integer programming, graph algorithms, complexity theory.
bulletM. Syslo, N. Deo and J. Kowalik, Discrete Optimization Algorithms with PASCAL Programs, Prentice-Hall, 1983 --- linear programming, integer programming, graph algorithms.
bulletJim Orlin's network opt book

Graph algorithms

bulletT. Cormen, C. Leiserson and R. Rivest, Introduction to Algorithms, McGrow-Hill/MIT Press, 1993 --- sets, graphs, growth of functions, graph algorithms.
bulletS. Skiena, The Algorithm Design Manual, Springer, 1998 --- growth of functions, graph algorithms, heuristics.
bulletP. H. Winston, Artificial Intelligence, Addison Wesley, 1992 --- graph algorithms, genetic algorithms.

Heuristics

bulletC. Reeves (ed.), Modern Heuristic Techniques for Combinatorial Problems, Wiley, 1993 -- heuristics.
bulletAny good book on SA?
bulletD. Goldberg, Genetic Algorithm in Search, Optimization and Machine Learning, Addison Wesley, 1989 --- genetic algorithms.
bulletM. Mitchell, Introduction to Genetic Algorithms, MIT Press -- genetic algorothms

Complexity Theory

bulletD. Bertsimas and J. Tsitsiklis, Introduction to Linear Optimization, Athena Scientific, 1997 --- linear programming, integer programming, complexity theory.
bulletM. R. Garey and D. S. Johnson, Computers and Intractability: A Guide to the Theory of NP-Completeness, Freeman, 1979 -- complexity theory.
bulletJ. C. Martin, Introduction to Language and the Theory of Computation, McGraw-Hill, 1991 -- complexity theory.
 

Course projects

When you go to a journal Web site, the default search option may be to search for an entire Web site, which includes articles of the journal as well as *other* journals by the same publisher. So when you search, be sure to select an option for searching articles within the journal.

bullet Artificial Intelligence for Engineering, Design, Analysis, and Manufacturing
bullet ASME Journal of Computing and Information Science in Engineering (JCISE)
bullet ASME Journal of Manufacturing Science and Engineering (JMS)
bullet ASME Journal of Mechahical Design (JMD)
bullet ASME Journal of Medical Devices
bullet Computer-Aided Design
bullet Engineering Optimization
bullet IEEE Transactions on Automation Science and Engineering (TASE)
bullet IEEE Transactions on Robotics (T-RO)
bullet Journal of Manufacturing Systems
bullet

Structural and Multidisciplinary Optimization

 

[Home] [Schedule] [Course notes] [Problem sets] [Project info] [References] [Past due policy]

College of Engineering

Please e mail to kazu@umich.edu with questions or comments about this web site.
Copyright © 2000-2006 Kazuhiro Saitou,
Last modified: September 01, 2006