1. Introduction Part I. Methods for Optimal Solutions: 2. Linear programming and applications 3. Convex programming and applications 4. Design of polynomial-time exact algorithm Part II. Methods for Near-Optimal and Approximation Solutions: 5. Branch-and-bound framework and application 6. Reformulation-linearization technique and applications 7. Linear approximation 8. Approximation algorithm and its applications - part 1 9. Approximation algorithm and its applications - part 2 Part III. Methods for Efficient Heuristic Solutions: 10. An efficient technique for mixed-integer optimization 11. Metaheuristic methods Part IV. Other Topics: 12. Asymptotic capacity analysis.
{{comment.content}}