Y
HN Search
Hacker News Search
new
|
comments
|
top
|
jobs
luiwammus
searching Neon…
1.
▲
2.
▲
3.
▲
4.
▲
5.
▲
6.
▲
7 ms
·
1.
▲
by
luiwammus
2mo ago
I guess it depends on what your application is here. Hexaly primarily focuses on Routing, Packing and Scheduling problems, which have strong Combinatorial components. My experience with those type of problems is that Hexaly is in its own le
2.
▲
by
luiwammus
2mo ago
The main reason why companies might prefer Hexaly is their emphasis on quickly finding high Quality feasible primal solutions.
3.
▲
by
luiwammus
2mo ago
Amazon has been quite vocal about using Hexaly.
4.
▲
by
luiwammus
4mo ago
I cant speak for engineers, but as a mathematician I wholeheartedly disagree with everything you claim in your comment. Almost none of the mathematicians that I know care about the optimization aspect of mathematics: the pursuit of optemizi
5.
▲
by
luiwammus
9mo ago
I would like to learn more about Web development and related knowledge (networking, security). Currently my programming knowledge is primarily system languages+python. I'm thinking of building a few websites / apps from scratch, a
6.
▲
by
luiwammus
1y ago
This is actually a pretty poor example because we can solve huge TSP instances to optimality in practice (see the concorde solver). There exist many more tricky Combinatorial problems such as packing or covering problems that are typically
7.
▲
by
luiwammus
2y ago
CPlex has shown no progression in the benchmarks in the past years, so it is safe to assume that the number of developers they have employed is either 0 or maybe 1.
8.
▲
by
luiwammus
2y ago
I am an academic in the field. A good starting point would be Tobias Achterberg's PhD thesis: "Constraint Integer Programming" It details the implementation of SCIP, which is one of the leading open source solvers, and explai
9.
▲
by
luiwammus
3y ago
Yes, there are other interior point methods besides the ellipsoid method, and virtually all of them perform better for linear programming. Sometimes, the solvers will use these at the root node for very large models, as they can beat out th
10.
▲
by
luiwammus
3y ago
As other commenters here have mentioned, in discrete optimization there can be a very large gap between efficienct in theory and efficient in practice, and it is very likely that this is the case here too. Linear programming for example is