update links in README.md

Author: jbytecode

README.md

@@ -23,19 +23,19 @@ julia> Pkg.add("OperationsResearchModels")
 
 # Implemented Problems and Algorithms
 
-- [Assignment Problem](https://jbytecode.github.io/OperationsResearchModels.jl/dev/algorithms/#Assignment-Problem)
-- [Transportation Problem](https://jbytecode.github.io/OperationsResearchModels.jl/dev/algorithms/#Transportation-Problem)
-- [The Shortest Path](https://jbytecode.github.io/OperationsResearchModels.jl/dev/algorithms/#Shortest-Path)
-- [Maximum Flow](https://jbytecode.github.io/OperationsResearchModels.jl/dev/algorithms/#Maximum-Flow)
-- [Minimum Spanning Tree](https://jbytecode.github.io/OperationsResearchModels.jl/dev/algorithms/#Minimum-Spanning-Tree)
-- [p-median for Location Selection](https://jbytecode.github.io/OperationsResearchModels.jl/dev/algorithms/#pmedian)
-- [CPM - Critical Path Method](https://jbytecode.github.io/OperationsResearchModels.jl/dev/algorithms/#CPM-(Critical-Path-Method))
-- [PERT - Project Evaluation and Review Technique](https://jbytecode.github.io/OperationsResearchModels.jl/dev/algorithms/#PERT-(Project-Evaluation-and-Review-Technique))
-- [The Knapsack Problem](https://jbytecode.github.io/OperationsResearchModels.jl/dev/algorithms/#Knapsack)
-- [Johnson's Rule for Flow-Shop Scheduling](https://jbytecode.github.io/OperationsResearchModels.jl/dev/algorithms/#Johnson's-Rule)
-- [Flow-shop Scheduling using Permutation Encoded Genetic Algorithms (using a Random Key Genetic Algorithm)](https://jbytecode.github.io/OperationsResearchModels.jl/dev/algorithms/#Genetic-Algorithm-for-the-problems-that-cannot-be-solved-with-using-Johnson's-Rule)
-- [Traveling Salesman with Random Key Genetic Algorithm](https://jbytecode.github.io/OperationsResearchModels.jl/dev/algorithms/#Traveling-Salesman)
-- [Simplex Method with Real Valued Decision Variables](https://jbytecode.github.io/OperationsResearchModels.jl/dev/algorithms/#Simplex)
+- [Assignment Problem](https://jbytecode.github.io/OperationsResearchModels.jl/dev/assignment/)
+- [Transportation Problem](https://jbytecode.github.io/OperationsResearchModels.jl/dev/transportation/)
+- [The Shortest Path](https://jbytecode.github.io/OperationsResearchModels.jl/dev/network/#Shortest-Path)
+- [Maximum Flow](https://jbytecode.github.io/OperationsResearchModels.jl/dev/network/#Maximum-Flow)
+- [Minimum Spanning Tree](https://jbytecode.github.io/OperationsResearchModels.jl/dev/network/#Minimum-Spanning-Tree)
+- [p-median for Location Selection](https://jbytecode.github.io/OperationsResearchModels.jl/dev/locationselection/)
+- [CPM - Critical Path Method](https://jbytecode.github.io/OperationsResearchModels.jl/dev/project/#CPM-(Critical-Path-Method))
+- [PERT - Project Evaluation and Review Technique](https://jbytecode.github.io/OperationsResearchModels.jl/dev/project/#PERT-(Project-Evaluation-and-Review-Technique))
+- [The Knapsack Problem](https://jbytecode.github.io/OperationsResearchModels.jl/dev/knapsack/)
+- [Johnson's Rule for Flow-Shop Scheduling](https://jbytecode.github.io/OperationsResearchModels.jl/dev/scheduling/#Johnson's-Rule-for-Flow-shop-Scheduling)
+- [Flow-shop Scheduling using Permutation Encoded Genetic Algorithms (using a Random Key Genetic Algorithm)](https://jbytecode.github.io/OperationsResearchModels.jl/dev/scheduling/#Genetic-Algorithm-for-the-problems-that-cannot-be-solved-with-using-Johnson's-Rule)
+- [Traveling Salesman with Random Key Genetic Algorithm](https://jbytecode.github.io/OperationsResearchModels.jl/dev/travelingsalesman/)
+- [Simplex Method with Real Valued Decision Variables](https://jbytecode.github.io/OperationsResearchModels.jl/dev/simplex/)
 
 
 # Notes for the users