Y
HN Search
Hacker News Search
new
|
comments
|
top
|
jobs
cerved
searching PlanetScale…
1.
▲
2.
▲
3.
▲
4.
▲
5.
▲
6.
▲
74 ms
·
871.
▲
by
cerved
7y ago
It's an example model of how to use the or-tools CP-SAT solver to solve employee scheduling problems. It's part of the or-tools library which is a framework for solving scheduling, routing and other NP-hard discrete optimization p
872.
▲
by
cerved
7y ago
By back to back, do you mean nurse 3 works shift 2 day 1 and shift 0 day 2? Or that nurse 3 always works two days in a row in the listed solutions? The example doesn't mention back to back shifts, only that a nurse can at most work one
873.
▲
by
cerved
7y ago
Using Excel sounds like a pain to maintain but if it works it works. Your problem sounds like a JSP (job shop scheduling problem). If it is you could use MiniZinc https://www.minizinc.org/ and look at Håkan Kjellstrans Mini
874.
▲
by
cerved
7y ago
CP solvers are excellent at handling side constraints, at least as long as they can be expressed as a boolean, discrete or linear relation.
875.
▲
by
cerved
7y ago
Are you referring to the first model? Only 5/5184 solutions are displayed. There's no objective function and the branching is probably defaulting to a simple systematic search with min domain, min value heuristic. If these are the
876.
▲
by
cerved
7y ago
Interesting. I imagine this was for exhaustive search? If 100ms is too long it sounds like a CP solver might be the wrong tool for the job.
877.
▲
by
cerved
7y ago
Depends on how much time and memory you've got, how optimal of a solution you need and the exact nature of the constraints. From what I've seen, solving problems with a good enough solution with a 1h time limit is usually doable u
878.
▲
by
cerved
7y ago
Did you use a wrapper or work directly with the solver? If you require runtimes that are that small the compilation time into the proto-model fed into the solver is likely a bottleneck. Usually the time horizon for solving these kinds of pr
879.
▲
by
cerved
7y ago
I'm glad to see the domain of constraint programming and operational research in general generate interest so I thought I would take the opportunity to share some links and resources I have found useful. Personally, I've spent mos
880.
▲
by
cerved
7y ago
Not just this year but the last couple of years
881.
▲
by
cerved
7y ago
You should check out http://www.hakank.org/ for a fantastic resource of optimization models for a huge variety of solvers and problems
882.
▲
by
cerved
7y ago
It is. The two main components is the CP-SAT solver and the routing library (CP + local search). As with all discrete optimization problems, a large part of performance and scalability comes down to how well you model the problem. Using a f
883.
▲
by
cerved
7y ago
This. Does it take into account scraping bots? I remember looking at my server logs many years ago, finding a surprising amount of Chinese and Russian visits for my personal website. Eventually I realized it was Baidu Yandex type stuff
884.
▲
by
cerved
7y ago
To be fair, it's clearly stated in the readme: "The performance claims only hold for small datasets, 1,000-100,000 numpy rows. Pandas perform better with larger data sets, the only functions that improve with a 1000x increase in s
885.
▲
by
cerved
7y ago
Lots of built in statistical stuff and powerful visualization makes exploring datasets easy
886.
▲
by
cerved
7y ago
I imagine OP is referring to things like conditional selection on multiple columns, not by AND && operators but by bitwise & operators. I've mostly use comprehensions to filter and manipulate data and I find the Panda API t
887.
▲
by
cerved
7y ago
I believe he's referring to the raid 5/6 issues
888.
▲
by
cerved
7y ago
Ok, looks similar to C#. Honestly I prefer maybe monads to null coalescing
889.
▲
by
cerved
7y ago
Does Kotlin have the maybe monad?
890.
▲
by
cerved
7y ago
The problem is that a lot of people who "don't like JavaScript" actually don't like dealing with the idiosyncrasies of web technologies. Instead of developing an understanding of the environment JavaScript was developed
891.
▲
by
cerved
7y ago
While it's just part one, I feel like whether the end result successfully overcomes the problems mentioned is missing. I wonder if in fact it does. Personally I wouldn't refactor an entire application from scratch unless it was fa
892.
▲
by
cerved
7y ago
Facebook provides a medium where most people can disseminate their message, with little restriction or cost, to a potentially large audience. It doesn't make everybody a journalist.
893.
▲
by
cerved
7y ago
Ah yes, let's turn this into a good old "your language sucks" thread
894.
▲
by
cerved
7y ago
Considering the US has one of the largest greenhouse gas emissions per capita, a lot. You have a lot of power.
895.
▲
by
cerved
7y ago
Sales commission for a Pre-Sales role is complicated. You get commission for deals that have been worked for 1+ quarters. If a big deal closes that you worked on for the last year while you're on leave, you wouldn't get commission
896.
▲
by
cerved
7y ago
Pre-Sales pretty much always get team comission and the kind of product Informatica sell have sales cycles longer than 1Q
897.
▲
by
cerved
7y ago
Sales Engineer typically means Pre-Sales. It's a supporting sales position, part of the sales organisation. I think the title is unnecessarily misleading.
898.
▲
by
cerved
7y ago
Amazing. Who would've thought a markup language would be appropriate for the task
899.
▲
by
cerved
7y ago
Ahaha, the fake memoir
900.
▲
by
cerved
7y ago
It was in response to the parent lacking OOP in FP. I think this is a problem with any language that supports multiple paradigms and ways to skin a cat. Enforcing guidelines is a way to combat that. Ofc you might also just opt for a more sp
More ›