Hacker News Reader

Comment by bubblyworld | Hacker News Reader

From an outsider... why does it seem that easy to you? They had a team of OR people working on this and presumably the money to buy a gurobi license.

View on HN

Because they did not show they used any methodological approach that we don't know for the past 30 years.

And according to the PR they did not use gurobi (or any sota mip solver), just their in-house lp solver in combination with shortest path algorithms and the fix-and-optimize heuristic.

Likely your particular use case will not fit their model anyway (for example you may want to consider contracts of affreighent along with leasing entire vessels).

So yes, or scientist and gurobi will definitely win.

On the other hand they cleared an open source benchmark by a long way, for which people have had plenty of time to apply existing approaches, right?

This is just a PR article, it's hard to say what they did or didn't try before arriving at this solution.

Because frankly nobody gives a sh about throwing resources and finding just better (not globally optimal) solutions to synthetic benchmarks.

Academics care about proving optimality. Businesses care about their own specific use case and not synthetic benchmarks.

Okay, well, thanks for your thoughts.

> Because frankly nobody gives a sh about throwing resources and finding just better (not globally optimal) solutions to synthetic benchmarks.

This does not align with my experience of people working in OR.

How do you come to this conclusion? They way I read it rather sounds like they use the CP-SAT solver with LNS and LS workers, parallelized over multiple machines

A heuristic using problem specific structure can beat Gurobi which is for solving general mip.

they do have a Gurobi license

Reply on news.ycombinator.com