David Torres Sanchez

Hi Aaesha,That last constraint I mentioned does exactly that. In some order, the appliances will be sequential without any overlap. If only one appliance can be scheduled at any given time, your pr...

Of course, you can just associate the objective value of a given variable as the sum of the costs for the duration. i.e. $$\textbf{min}~ \sum_i\sum_t \left(\sum_{t'=t}^{t+d_i} c_{it'}\right)x_{it}$...

I see! Yes, I think that should be possible. You can have two separate functions for this (outside or inside a single callback function up to you) that add the constraints as required. You'll need ...

I think this can be achieved using a single callback (only one can be passed to Gurobi). In the callback example, using the MIP callback, you can check if the GAP is large enough and terminate earl...

Hi Aaesha,It seems your durations are fixed, so your duration constraint can simply be written as `=1` and then variables represent the start time of the activity (you know that the end time is jus...

That seems like the best way to do it using the Python API. Have you already tried this?Alternatively, you can maybe also try using the Python Matrix API (see an example and some relevant articles)...

I am not sure we have access to any hardware to test M1-pro chips.On the standard M1 it works like a charm on the current version 9.5.1. Cheers,David

There's is an experimental version available with the current version 9.5.1. You can download it from the downloads page. Feedback is very welcome. Cheers,David

Hi Jingyue, Yes, of course if you'd like to find the shortest path in terms of flight time. But you can use a cost proportional to how attractive the flight is (e.g. may be delayed). The added bene...

Hi, I am not sure what you mean, could you can elaborate a bit more? You can model the shortest path as a MIP using a binary variable for each edge and flow balance constraints (a quick google sear...