I'd say the only study order is first study linear programming. This will help with everything else. I learned a great deal of what I use of combinatorial optimization through classes, and studying network optimization. For the latter, I recommend the book of Ahuja, Magnanti, and Orlin, "Network Flows", as well as the algorithms books of Cormen, Leiserson, Rivest, Stein, and Kleinberg and Tardos. I did use the book of Papadimitriou and Steiglitz as a grad student. A couple of very good references are the opus "Combinatorial Optimization" by Alexander Schrijver, as well as the earlier book "Geometric Algorithms and Combinatorial Optimization". The reference I use for integer programming is Schrijver's book "Theory of Linear and Integer Programming". For nonlinear programming, I use a variety of references. Sometimes I use "Numerical Optimization" by Nocedol and Wright. Combinatorial Optimization, by William J. Cook, William H. Cunningham, William R. Pulleyblank, Alexander Schrijver, Convex optimization, by Stephen Boyd, Lieven Vandenberghe
沒有留言:
張貼留言