Lecture 1 Introduction to the Course of Optimization讲座1介绍优化课程.pptVIP

Lecture 2: The Greedy Method 主講人:虞台文 Content What is it? Activity Selection Problem Fractional Knapsack Problem Minimum Spanning Tree Kruskal’s Algorithm Prim’s Algorithm Shortest Path Problem Dijkstra’s Algorithm Huffman Codes Lecture 2: The Greedy Method What is it? The Greedy Method A greedy algorithm always makes the choice that looks best at the moment For some problems, it always give a globally optimal solution. For others, it may only give a locally optimal one. Main Components Configurations different choices, collections, or values to find Objective function a score assigned to c