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 ...

Mixed-integer nonlinear programming (MINLP) optimisation constitutes a critical methodology in tackling complex decision-making problems where both discrete choices and continuous variables are ...

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 ...