The feasibility pump is a well-established primal heuristic for mixed integer programming (MIP) that alternates between solving a linear programming (LP) relaxation of the original problem and ...

The 0/1 Knapsack problem is a classic optimizaation problem in algorithm design. The objective is to determin the maximum value that can be obtained by selecting items to place in a knspsack without ...

Abstract: In manufacturing-related industries, scheduling of resources and tasks play an important role in improving efficiency and productivity as well as reducing costs. Job-shop scheduling problem ...

Julia and Python recursion algorithm, fractal geometry and dynamic programming applications including Edit Distance, Knapsack (Multiple Choice), Stock Trading, Pythagorean Tree, Koch Snowflake, ...

Abstract: The Distribution Network Reconfiguration (DNR) problem is a well-known problem in the field of power system optimization. It consists of altering the state of the switches in Distribution ...