Rounding and Dynamic Programming:Parallel Macines Job Scheduling
From this blog, we will talk about “rounding data” strategy and dynamic programing applied in approximation algorithm in detail. And this blog will focus on the problem “scheduling jobs on identical parallel macines”.
Lecture 16:Implementations of the simplex method
This blog is talking about the naïve implementation of simplex method and then focus on how to speed up simplex method. And the second idea induce the Simplex Tableau implementation.
Gready Alg and Local Search:Minimum-Degree Spanning Tree
This blog is still talking about greedy algorithm and local search. And this blog will focus on the minimum-degree Spanning Tree problem.
Gready Alg and Local Search:Parallel Macines Job Scheduling
This blog is still talking about greedy algorithm and local search. And this blog will focus on the problem “Scheduling jobs on identical parallel machines”.
Lecture 15:Develop of the simplex method
This blog is talking about how along we can move along basic feasible direction, i.e. ${ \theta }$ and talking abou the termination of Simplex Method.
Gready Alg and Local Search:The k-center problem
This blog is still talking about gready algorithm and local search. And this blog will focus on the k-center problem.
Gready Alg and Local Search:Single Macine Job Scheduling
From this blog, we will talk about gready algorithm and local search in detail. And this blog will focus on the problem “scheduling jobs with deadlines on a single machine”.
Lecture 14:Optimality of a basic feasible solution
This blog is talking about how to move to another basic feasible solution and how to judge the basic feasible solution is optimal.
99 post articles, 13 pages.