Knapsack Optimization with Python

แชร์
ฝัง
  • เผยแพร่เมื่อ 25 ม.ค. 2025

ความคิดเห็น • 6

  • @sc0v0ne
    @sc0v0ne 5 หลายเดือนก่อน +1

    Very good classroom, thanks Professor

  • @lucasbernardoni
    @lucasbernardoni ปีที่แล้ว +1

    Helped me a lot! Thanks for sharing this amazing content :)

  • @hassanlaqrabti4036
    @hassanlaqrabti4036 ปีที่แล้ว +2

    Professor do you see that I’m in necessity to learn MATLAB as I used to use python

    • @apm
      @apm  ปีที่แล้ว

      Python is a powerful tool, but you can also think of it as a Matlab toolbox. Here is a tutorial on calling Python from Matlab: apmonitor.com/che263/index.php/Main/MatlabCallsPython

  • @supriyamanna715
    @supriyamanna715 ปีที่แล้ว +1

    proff, is this mixed integer solution taking linear time for selecting the items needed?
    the greedy one takes n logn as we have to sort and then take the ones needed

    • @apm
      @apm  ปีที่แล้ว

      I’m not sure there is a deterministic scale up factor proven for mixed integer linear programming. The solution speed often depends on tuning parameters, such as gap tolerance.