frontpage.
newsnewestaskshowjobs

Open Source @Github

fp.

How to make almost anything

https://pub.cba.mit.edu/863.26/site/
259•o4c•3h ago•45 comments

Universal XSS in uBlock Origin from website-driven element picker

https://iter.ca/post/ubo-uxss/
352•zaik•7h ago•98 comments

Qwen4-Max

https://qwen.ai/blog?id=qwen4-max
488•ilreb•7h ago•199 comments

Old Bitly links are being hijacked

https://ransomnews.com/burger-king-tweet-bitly-link-hijack-2026/
280•hspeiser•11h ago•144 comments

What's Next for Nvidia?

https://steveblank.com/2026/11/15/whats-next-for-nvidia/
256•zdw•9h ago•330 comments

Researchers track whole body movement with just a smartwatch

https://news.cornell.edu/stories/2026/11/researchers-track-whole-body-movement-just-smartwatch
28•PaulHoule•2d ago•3 comments

Tor Project Issues Rapid-Response DoS-Defense Fix Amid Sustained DDoS Attack

https://forum.torproject.org/t/security-release-0-4-9-17/22454
145•aillia•9h ago•43 comments

Protomaps: Self-hosting map tiles has gotten cheap and easy

https://bruceroettgers.eu/blog/protomaps/
330•bcye•14h ago•56 comments

Preserving 30 years of Salon journalism

https://blog.archive.org/2026/11/12/preserving-30-years-of-salon-journalism/
147•CharlesW•10h ago•38 comments

A short explainer on how El Niño works [video]

https://www.youtube.com/watch?v=7_JF3etiAv8
236•nharada•15h ago•106 comments

Handwriting, as a Font

https://ductus.sorenblank.com
283•coinfused•14h ago•52 comments

Do we still have to denormalize? Have your schema and search it too

https://www.paradedb.com/blog/joins
73•philippemnoel•2d ago•12 comments

The Lasting Influence of John Berger

https://www.newyorker.com/magazine/2026/11/16/john-berger-a-life-tom-overton-book-review
17•prismatic•4d ago•0 comments

Stop Filming in Log

https://digitalfilms.wordpress.com/2026/11/15/stop-filming-in-log/
52•dabinat•5h ago•35 comments

Crows make decisions faster than we can

https://www.nytimes.com/2026/11/15/science/birdbrain-crows-birds-research-decision.html
237•gumby•15h ago•161 comments

Simple 8085 Computer

https://www.hackster.io/mit41301/simple-8085-computer-9fe156
37•AlexeyBrin•3d ago•3 comments

WebGL Flight Simulator with seed generated terrain

https://baron.by.dai.studio/
147•ranger_danger•13h ago•29 comments

Making Atuin sync 32x faster with packfiles

https://blog.atuin.sh/making-atuin-sync-32x-faster-with-packfiles/
11•ossusermivami•4d ago•1 comments

Artificial Intelligence for the Z80

https://www.dfsantos.com/en/libro-ia-z80
43•AlexeyBrin•2d ago•4 comments

Mini.nvim Is Now on Tangled

https://tangled.org/nvim-mini.org/mini.nvim
65•nerdypepper•9h ago•18 comments

Debian Becomes Unresponsive after 6.1.0-55 Kernel Update

https://bugs.debian.org/cgi-bin/bugreport.cgi?bug=1154101
87•artooro•4h ago•25 comments

Did the Apollo Guidance Computer use 60% of the ICs in 1963?

https://retrocomputing.stackexchange.com/questions/12158/did-the-apollo-guidance-computer-really-...
12•Skyfall106•4h ago•1 comments

Skydio's asymmetrical F10 Lightrunner solves a problem with fixed-wing drones

https://spectrum.ieee.org/skydio-f10-lightrunner-asymmetrical-drone
41•Gaishan•9h ago•3 comments

A quest to create the perfect whiskey glass

https://www.nytimes.com/2026/11/13/dining/drinks/kurt-josef-zalto-whiskey-glass.html
65•Kaibeezy•2d ago•68 comments

Microsoft 365 outage leads to chlorine gas poisoning of 15 hotel guests

https://www1.wdr.de/nrw/rheinland/rhein-erft-kreis/technischer-defekt-chlor-phantasialand-100.html
533•DeepLogin•15h ago•232 comments

Eclipse Mosquitto – An open source MQTT broker

https://github.com/eclipse-mosquitto/mosquitto
93•gregsadetsky•15h ago•32 comments

SpaceX catches the Starship to end Flight 15

https://www.spacex.com/launches/starship-flight-15
1691•ls612•1d ago•1267 comments

Parcel: A desktop mail client for Linux, built with Zig

https://tangled.org/rockorager.dev/parcel
33•nerdypepper•9h ago•7 comments

Clice v1.0 Released: Welcome to Modern C++

https://ykiko.me/en/articles/2105384023094834022/
157•molenzwiebel•16h ago•85 comments

Emacs Is My Browser

https://joshblais.com/blog/emacs-as-my-browser/
206•nyc111•18h ago•121 comments
Open in hackernews

Linear Programming for Fun and Profit

https://modal.com/blog/resource-solver
62•hmac1282•1y ago

Comments

ayhanfuat•1y ago
> X = [x1, ..., Xn]: instances of each type to launch

Is this a continuous variable? Seems discrete to me. I am surprised it is solved by simplex.

Frummy•1y ago
It's the answer, a vector of integers
ayhanfuat•1y ago
Simplex cannot give a vector of integers though, unless the constraint matrix is unimodular. Maybe the integrality constraint was relaxed.
cweld510•1y ago
You're right -- we do relax the integrality constraint, gaining performance at the expense of some precision, and we're generally able to paper over the difference at scheduling time. We've investigated integer linear programming for some use cases, but for solves to run quickly, we have to constrain the inputs significantly.
ayhanfuat•1y ago
Thanks for the clarification. I guess it wouldn’t matter much if the numbers are large. Initially I thought they were mostly ones and zeros.
stncls•1y ago
If this is business critical for you, you may want to switch to a faster solver. Glop is very nice, but it would be reasonable to expect a commercial solver (Gurobi, XPress, COpt) to be 60x faster [1]. By the same measure, the best open source solvers (CLP, HiGHS) are 2-3x faster than Glop.

Actually, the commercial solvers are so fast that I would not be surprised if they solved the IP problem as fast as Glop solves the LP. (Yes, the theory says it is impossible, but in practice it happens.) The cost of a commercial solver is 10k to 50k per license.

[1] ... this 60x number has very high variance depending on the type of problem, but it is not taken out of nowhere, it comes from the Mittelmann LP benchmarks https://plato.asu.edu/ftp/lpopt.html There are also benchmarks for other types of problems, including IP, see the whole list here: https://plato.asu.edu/bench.html

petters•1y ago
If you are able to paper over the fractional numbers and get a usable solution, an integer solver should also be able to find a feasible solution easily. Perhaps not optimal, but better than just solving the LP and rounding
hustwindmaple1•1y ago
You are basically doing a heurstic. Your solutions are not guaranteed to be optimal. Integer programming is the way to do.
cweld510•1y ago
Great to see this post here -- really enjoyed writing it! I think it's really cool how an algorithm from an operational research context can play a critical role in a high-availability large-scale cloud service.
sumtechguy•1y ago
LP is a shockingly good way to optimize a system. If you can put inputs/outputs into the correct form. Had an econ prof that loved these things for doing supply/demand maxima and minimum finding. He didnt outright say it but I think it was his current line of study when I was taking classes from him the 90s. I thought that, as he managed to bring it up in every class he taught.
Onavo•1y ago
Well, kantorovich did win the Nobel for inventing that.
underanalyzer•1y ago
Neat article. I do wish it mentioned that there are polynomial time algorithms to solve linear programming problems. According to the Google ortools docs it has the option to use those as well (but not with the GLOP solver). Might be good for when simplex is struggling (https://developers.google.com/optimization/lp/lp_advanced)
stncls•1y ago
You're right, but it's very subtle and complicated.

In theory, the simplex method is not known to be polynomial-time, and it is likely that indeed it is not. Some variants of the simplex method have been proven to take exponential time in some worst cases (Klee-Minty cubes). What solvers implement could be said to be one such variant ("steepest-edge pricing"), but because solvers have tons of heuristics and engineering, and also because they work in floating-point arithmetic... it's difficult to tell for sure.

In practice, the main alternative is interior-point (aka. barrier) methods which, contrary to the simplex method, are polynomial-time in theory. They are usually (but not always) faster, and their advantage tends to increase for larger instances. The problem is that they are converging numerical algorithms, and with floating-point arithmetic they never quite 100% converge. By contrast, the simplex method is a combinatorial algorithm, and the numerical errors it faces should not accumulate. As a result, good solvers perform "crossover" after interior-point methods, to get a numerically clean optimal solution. Crossover is a combinatorial algorithm, like the simplex method. Unlike the simplex method though, crossover is polynomial-time in theory (strongly so, even). However, here, theory and practice diverge a bit, and crossover implementations are essentially simplified simplex methods. As a result, in my opinion, calling iterior-point + crossover polynomial-time would be a stretch.

Still, for large problems, we can expect iterior-point + crossover to be faster than the simplex method, by a factor 2x to 10x.

There is also first-order methods, which are getting much attention lately. However, in my experience, you should only use that if you are willing to tolerate huge constraint violations in the solution, and wildly suboptimal solutions. Their main use case is when other solvers need too much RAM to solve your instance.

Onavo•1y ago
The most interesting question is how you scrape the prices. The cloudprovider really need to provide an API.
underanalyzer•1y ago
Very interesting! Thanks for the reply. I wonder if they tried these other solvers and decided they were either too slow b/c their problems were too small or the answers were too inaccurate