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: It is a well known fact that finite time optimal controllers, such as MPC do not necessarily result in closed loop stable systems. Within the MPC community it is common practice to add a ...

Abstract: In this paper, an energy-efficient predictive cruise control (PCC) algorithm for commercial vehicles that can optimize vehicle speed in real time is proposed. The predictive cruise problem ...