> 4000 integers and a couple hundreds of constraints we can can typically solve today to proven global optimality within seconds
Oh really? I got a problem with 1064 binary variables and 8000ish constraints. Surely you can solve it for me. I do just require a solution not even an optimal solution.
I said typically. These are NP problems you can always find edge cases that are impossible to solve.
For these edge cases we can always reformulate the problem, aka use different definition of variables and constraints that can better inform the search.
We are talking about real world applications, not toying with pathogenic benchmark toy examples.
I'm a bit new to this (not QC but linear programming/optimization in general), could you share some libraries or code that is considered state of the art on this?
I would really like to see the model of the problem for this kind of sensor placing. I am sure there are complex problems but my model would basically be two crates of beer between each sensor.
If anyone from BMW is reading this, I will contend that you will get more interest if the sites that host your information are search indexable and if the news briefs published about the contest and conference actually refer back to the conference/contest website.
That is really interesting, it is sometimes difficult to imagine the questions they ask themselves. If they include specific sensors with different properties I could see the complexity quickly increasing.
side note: The TLS cert for their site is invalid since today (was valid until 22-07-31).
