cerved

It's not a tariff

The Coursera courses are a great resource for learning how to model problems.

> any good primer literature I might check out for understanding the basis of tweaking constraint solvers? I have started running into some performance issues after integrating an optimization function, and have started to wonder how can I claim back some performance.

There is usually less tweaking of solvers and much more remodeling the problem using a different viewpoint or constraints to solve the problem. There courses teach you that. But beware that's it's not so trivial.

Also, careful with LLMs and constraint solvers, sometimes they yield absolute rubbish.

Presumably you run it with multiple workers, preferably in parallel (it's designed to run like that)

Depending on your problem and how you can solve it (single threaded & low memory vs. anything goes) it might be a good idea trying other solvers. OR-Tools CP-SAT(LP) pretty much never does bad on a any problems but there are other CP-SAT solvers like Chuffed & Huub as well as Gecode which is a pure CP solver that does great providing you can make a gif search heuristic up front. Another option is of course racing solvers.

Then there are other things like MIP solvers, CBLS solvers etc. The nice thing with MiniZinc is that it's pretty easy to compare different solver backbends for a problem

The author said they used Claude to decide which E2E tests to run and "Claude never missed a relevant E2E test."

How many times did they conduct this experiment? Over how long time? How did they determine which tests were relevant and that Claude didn't miss them? Did they try it on more than one project?

My point was that none of this tells me this will work in general

No. They use sophisticated algorithms called propagators to prune the invalid solutions from the domains of possible solutions in conjunction with a search strategy, like branch and bound

Which solver do you use?

Define large. We've written model which solves real business issues in 8K lines of MiniZinc and it wasn't slow.

The conventional wisdom is the larger you make an NP hard problem, the slower is going to get. Irregardless of algorithm.

I've worked on a model with thousands of variables and hundreds of thousands of parameters with a hundred constraints. There are pitfalls you need to avoid, like reification, but it's definitely doable.

Of course, NP hard problems become complex at an exponential rate but that doesn't change if you use another exact solving technique.

Using local-search are very useful for scaling but at the cost of proven optimality

Well if your using MiniZinc you're free to use a CP solver, MIP solver, SAT solver, CP-SAT-LP solver. In general the model is roughly the same, even though some formulations work better for some solvers than others.

But CP (and CP-SAT) solvers tend to do very well on scheduling problems

from ortools.sat.python import cp_model

Not only has he made a great website, he's also a super nice guy

MiniZinc is a really great modeling language for constraint programming. Back in August I gave a talk at NordConstNet25 on how we used it to build a product configurator in what's (probably) the worlds largest MiniZinc model

https://pierre-flener.github.io/research/NordConsNet/NordCon...

I think the point is, E2E takes too long, so it was only run nightly. Now it's also run, selectively, as well as nightly

Well since it never broke for some rando on the internet, surely that means it will always work for everyone

It doesn't. That's why it's the responsibility of the application layer to correctly implement the data model of the database and not the other way around

That's what FIXME is for

(D)ash is not bash --posix

They are not the author of fzf

Postgres presumably

LMS/GLAS

Probably more like need to use it. Basically nano for windows

I like it because it's language and tooling agnostic, declarative, fast and ubiquitous.

Where it's less great is complicated recipes and debugging

What about a CP-SAT solver?

<3 GNU Make

it's fasterb and has a functional vim interface

Is there something related to Access in this that I missed in this or you just being salty, because I have to work with that garbage and if there's something better than DBeaver I can use for that I'm all ears

More streamlined UI. I find the graph viewer to display some things nicer, like coloring tables, bringing in related tables. Slightly better introspection and code formatting. Easier refactoring capabilities. Easier to get IdeaVim working then whatever Ecplise plugin is needed in DBeaver.

In my experience, DataGrip has been easier to get up and running out of the box and bringing the big IDE guns than DBeaver but DBeaver also does done this really well. For example I have never been able to setup DG with Access but DBeaver works pretty good out of the box with that garbage. Also it's free.

Both are solid

SSMS is what my nightmares are made of

Since most databases expose similar schema views it shouldn't be too complicated. Feels like JetBrains has been doing this for a long time

I'm more confused why the version control of the thing using the database is including the entire schema of the database in it's repository