After several years of exploring, my current gotos are: * Minion for IP for scheduling + edge crossing minimization. * cvxpy (wrapping ECOS, OSQP, and SCS by default) for convex optimization for making nice geometry. * Z3 and STP for SAT/SMT for program analysis. All are FLOSS, which is my main criterion in many situations. Beyond that, I like minion for its focus on only providing efficiently implementable primitive…
I'm curious what kind of person has 3 favorite constraint optimizers. What do you do that has you making use of so many different ones?
Ask HN: Do you use an optimization solver? Which one? Do you like it?
71–80 of 158 posts
Re: Ask HN: Do you use an optimization solver? Which one? Do you like it?
#72Re: Ask HN: Do you use an optimization solver? Which one? Do you like it?
#73lpsolve is simple to use. Open source, with packages in most every language. Easy to embed.
CPLEX because it's fast. With CPLEX I often find it takes more time (1 - 2 orders of magnitude) to formulate/construct the problem than it does for CPLEX to actually solve it.
I would love to get the chance to use Gurobi.
Re: Ask HN: Do you use an optimization solver? Which one? Do you like it?
#74Related question, what are broad recommendations for vehicle routing with capacity, time windows, and a smattering of other constraints? I'm a generalist SWE by trade and my (shallow) survey of the field revealed: General solvers: - LocalSolver: good docs, reasonable pricing, docs make it sound fast - ORTools: Open source, we we're leaning towards this since we're not doing anything incredibly fancy and it'd be nice…
Re: Ask HN: Do you use an optimization solver? Which one? Do you like it?
#75Re: Ask HN: Do you use an optimization solver? Which one? Do you like it?
#76http://plato.asu.edu/bench.html
This one stays pretty well updated. On the MIP side:
* COPT
* SCIP
* HiGHS
seem to be top performers (of the OSS variety).IIRC OR-Tools often by default uses SCIP for its MILP backend.
Re: Ask HN: Do you use an optimization solver? Which one? Do you like it?
#77Earlier quoted context omitted.
I love JuMP too. I am very amateur when it comes to optimization, but I found it to be a very efficient way to describe a matching algorithm for a post card exchange I ran (think of it as a Secret Santa, but generalized to each person sending multiple gifts, and discouraging mutual exchanges.) Here's the code: https://twitter.com/paulgb/status/1462483698427781120 To OP's question, besides JuMP, the other use case I'v…
> here’s the code > link to twitter visible_confusion.png.jpg.exe
Re: Ask HN: Do you use an optimization solver? Which one? Do you like it?
#78My typical setup is using Pyomo for model formulation (gives me flexibility to switch out solvers with ease). I bundle multiple licenses using GAMS, it is more cost effective than purchasing individual licenses from solver companies.
Re: Ask HN: Do you use an optimization solver? Which one? Do you like it?
#79Earlier quoted context omitted.
> so I ended up having to write a simulated annealing algo I think there are much better algorithms in metaheuristic search than just simulated annealing.
would you be able to offer some examples and some discussion of how to choose?
Re: Ask HN: Do you use an optimization solver? Which one? Do you like it?
#80SCIP, GLPK. I don't mind the overhead in developer time. Once you 'git gud' at translating problems to MIP/ LP, it's just a matter of learning syntax. The real trick is in translating problems. It's a shame more CS courses don't focus on this problem translation meta-algorithm. You can get it in tough theory courses with problem mapping to prove complexity, but its usefulness goes way, way beyond that somewhat niche…