Filipe Brandao

Thanks for the interest in the project! I am not sure if understood correctly what you need, but I believe you have knives that are wide and solutions without taking...

Thanks for your feedback! Code for multi-stage cutting stock and cost-based cutting stock will be included in the next release. It should be released by the end of this month....

@S1LV3RJ1NX, could you please provide the instance that results in this error?

Can you modify the application to display the MVP file before solving so that you can see the one that resulted in the error? This error means that something went...

@S1LV3RJ1NX, I still haven't found the exact same issue you had yet but I got a different error. One thing I noticed is that you use many bin types for...

With the modified script [bin_packing_v2.py.zip](https://github.com/fdabrandao/vpsolver/files/9316865/bin_packing_v2.py.zip), I obtained the following solution: ``` Objective: 3 Solution: Bins of type 1: 3 bins 1 x [i=1 opt=1, i=2 opt=1, i=4 opt=1, i=5 opt=1,...

@S1LV3RJ1NX, yes, if you get the assertion error for nfits >= 0 it means that some item could not be allocated anywhere and the problem is known to be infeasible...

Thanks for reporting this issue. I have just released pyvpsolver-3.1.4 which should address this issue. This versions comes of precompiled Python wheels up to Python 3.11, so it should not...

Hi @S1LV3RJ1NX, The performance is tied substantially to the size of graph replicating all valid patterns. One thing that has most impact is the number of items that fit in...

What was the maximum number of tasks in a single bin in the optimal solution? If you could provide the instances it should be easy to see why some are...