Ali Eshragh

Solving Hard Bi-objective Knapsack Problems Using Deep Reinforcement Learning

  • Sasan Mahmoudinazlou
  • Hadi Charkhgard
  • Ali Eshragh
    • Categories Approximation Algorithms, Integer Programming Tags , , ,

    We study a class of bi-objective integer programs known as bi-objective knapsack problems (BOKPs). Our research focuses on the development of innovative exact and approximate solution methods for BOKPs by synergizing algorithmic concepts from two distinct domains: multi-objective integer programming and (deep) reinforcement learning. While novel reinforcement learning techniques have been applied successfully to single-objective … Read more

    Learning to Project in Multi-Objective Binary Linear Programming

  • Hadi Charkhgard
  • Iman Dayarian
  • Ali Eshragh
  • Sorna Javadi
  • Alvaro Sierra-Altamiranda
    • Categories (Mixed) Integer Linear Programming, Multi-Criteria Optimization, Other Topics Tags , , , ,

    In this paper, we investigate the possibility of improving the performance of multi-objective optimization solution approaches using machine learning techniques. Specifically, we focus on multi-objective binary linear programs and employ one of the most effective and recently developed criterion space search algorithms, the so-called KSA, during our study. This algorithm computes all nondominated points of … Read more

    Best subset selection via bi-objective mixed integer linear programming

  • Hadi Charkhgard
  • Ali Eshragh
    • Categories Multi-Criteria Optimization, Statistics Tags , ,

    We study the problem of choosing the best subset of p features in linear regression given n observations. This problem naturally contains two objective functions including minimizing the amount of bias and minimizing the number of predictors. The existing approaches transform the problem into a single-objective optimization problem either by combining the two objectives using … Read more