frontpage.
newsnewestaskshowjobs

Open Source @Github

fp.

LLMs reward expertise

https://www.seangoedecke.com/llms-reward-expertise/
236•MaxMussio•1h ago•100 comments

Ten advances in mathematics and theoretical computer science

https://openai.com/index/ten-advances-in-mathematics/
377•milkshakes•6h ago•670 comments

Devtools must be open source

https://blog.exe.dev/devtools-must-be-open-source
458•bryanmikaelian•8h ago•169 comments

Ask HN: Who is hiring? (August 2026)

53•whoishiring•8h ago•77 comments

Windows XP 2002 for the Itanium: Unbridled rage

https://virtuallyfun.com/2026/08/03/windows-xp-2002-for-the-itanium-unbridled-rage/
20•jandeboevrie•1h ago•0 comments

200 Milliseconds

https://200ms.thenodebook.com
145•dimitarpanov•2d ago•47 comments

Smaller, faster, safer: running Kimi and GLM at scale

https://blog.cloudflare.com/smaller-faster-safer-models/
118•ascorbic•6h ago•30 comments

Ask HN: Who wants to be hired? (August 2026)

18•whoishiring•8h ago•131 comments

Celebrating 45 Years of Kermit with the First New C-Kermit Release in 15 Years

https://changelog.complete.org/archives/44456-celebrating-45-years-of-kermit-with-the-first-new-c...
115•roryirvine•6h ago•32 comments

MiniMax H3 Day-0 Support in ComfyUI: Open Weights, Native Audio, and 2K Video

https://blog.comfy.org/p/minimax-h3-day-0-support-in-comfyui
236•vblanco•9h ago•74 comments

Battle of the Beams

https://en.wikipedia.org/wiki/Battle_of_the_Beams
7•petethomas•2d ago•0 comments

Andy Pavlo joins ClickHouse to establish ClickHouse Labs

https://clickhouse.com/blog/andy-pavlo-joins-clickhouse
250•nikolay_sivko•9h ago•53 comments

The Dunning-Kruger effect may just be a data artefact (2020)

https://www.mcgill.ca/oss/article/critical-thinking/dunning-kruger-effect-probably-not-real
96•audreyfei•3h ago•104 comments

Launch HN: Hoplite (YC S26) – Effortlessly deploy cloud coding agents

https://hoplite.sh
49•BenceRed•6h ago•48 comments

Replacing the Kobo Libra H2O Battery

https://ei3lh.eu/2025/11/20/replacing-the-kobo-libra-h2o-battery/
32•austinallegro•4d ago•5 comments

How Hollywood stopped making movies in Hollywood

https://www.statsignificant.com/p/how-hollywood-stopped-making-movies
154•speckx•6d ago•177 comments

ZX Spectrum System Tour: Text Mode – Bumbershoot Software

https://bumbershootsoft.wordpress.com/2026/05/30/zx-spectrum-system-tour-text-mode/
7•rbanffy•1h ago•0 comments

Kelly Criterion Simulator

https://kellysimulator.com/
46•aleyan•3d ago•22 comments

Massively Parallel Postgres Backups

https://planetscale.com/blog/massively-parallel-postgres-backups
82•ksec•3d ago•9 comments

AirLLM 70B inference with single 4GB GPU

https://github.com/lyogavin/airllm
176•Anon84•11h ago•69 comments

Bonsai: Janestreet's UI Library

https://github.com/janestreet/bonsai
289•KolmogorovComp•14h ago•111 comments

ZX Spectrum System Tour: Sound

https://bumbershootsoft.wordpress.com/2026/08/01/zx-spectrum-system-tour-sound/
27•ibobev•4h ago•5 comments

KisakCOD – open-source reimplementation of Call of Duty 4 Multiplayer

https://github.com/SwagSoftware/KisakCOD
25•skibz•4h ago•3 comments

The Billable Usage API: programmatic cost visibility for Cloudflare

https://blog.cloudflare.com/billable-usage-api/
37•ashleypeacock•5h ago•6 comments

Twenty Years of Pandoc

https://pandoc.org/twenty-years-of-pandoc.html
62•fiddlosopher•8h ago•6 comments

DDoS against Norwegian government IT infrastructure – status

https://status.digdir.no/incidents/d7hvqmf2yr3l
76•e12e•3h ago•56 comments

Prevent cognitive debt by manually retyping LLM-generated code

https://ankursethi.com/blog/prevent-cognitive-debt-by-manually-retyping-llm-generated-code/
357•mpweiher•13h ago•292 comments

Use Task Runners for Common Coding Tasks

https://hamvocke.com/blog/task-runners/
59•speckx•6h ago•19 comments

SearXNG in Rust

https://github.com/MikeLuu99/searxng-rust
55•dluuuu•6h ago•19 comments

Show HN: Product analytics (and evals) for agent sessions on your MCP

https://armature.tech/
36•screm•6h ago•2 comments
Open in hackernews

Computational Complexity of Air Travel Planning [pdf] (2003)

http://www.demarcken.org/carl/papers/ITA-software-travel-complexity/ITA-software-travel-complexity.pdf
76•rochoa•1y ago

Comments

buildsjets•1y ago
This is well over 20 years old and is based on pre 9/11 flight data. I would suspect that a lot has changed since then. So proceed with no caution at all.
gwern•1y ago
Since these sorts of things usually only get more and more complex over time, I would guess that it's all still true, but much more so.
throw0101b•1y ago
(2003)
throw0101b•1y ago
The PDF was produced by ITA, which famously used Common Lisp:

* https://en.wikipedia.org/wiki/ITA_Software

From 2001, a message from the same author as the linked paper:

> (Here's an email Carl de Marcken of ITA Software sent to a friend, describing their experiences using Lisp in one of the software industry's most demanding applications.)

* https://www.paulgraham.com/carl.html

Qem•1y ago
Are there any public, open, comprehensive datasets on flights?
dieselerator•1y ago
> Are there any public, open, comprehensive datasets on flights?

Airlines and commercial aviation operators schedule their own flights. That is a dynamic schedulle. So, perhaps there is no "comprehensive data set".

However, FlightAware makes publicly available scheduled and completed flight data over many routes in the USA. You can search by route and get a list of flights.

Flight information includes filed departure time, route of flight, and speed. For completed flights actual time, altitude, and route is shown. For example, a search on the route Dallas/Fort Worth to Austin lists 45 flights.

I hope that helps.

foundart•1y ago
A very interesting dive into, as the title says, the computational complexity of air travel planning. Graph algorithms with lots of complexity added due to the wide variety of fare conditions that airlines have dreamt up over the years.

The article may be from 2003 but I would call it an evergreen. While I imagine some of the details have changed since then, I suspect that the complexity has only grown since then.

foundart•1y ago
It makes me wonder: Would an airline that drastically simplified its fares be more likely to appear in flight search results?

Simplifying the fares would make it less computationally expensive and, in theory, could take fewer steps to answer a flight planning query.

Imagine a flight search planner that, say, fanned out N airline-specific workers when handling a planning query and then displayed to the user whatever results it got back within some time limit. If FooAir had simple fares, the FooAir searcher would likely run faster than searchers for other airlines. Thus it would be more likely to return results for more queries, assuming the deadline is fairly tight because of usability metrics. (People don't tend to stick around waiting for slow results.)

sjburt•1y ago
At least a few years ago (~2014), the fare search was actually nearly instant, but all major airfare search sites added a delay because customers had the impression they were getting a better deal when they had to wait. It seems like the delay has been dialed back lately.
teleforce•1y ago
This is a very popular article that get submitted every now and then (nearly every year) [1].

I think this kind of problem would be a very nice for logic, optimization and constraint programming that probably can be solved with modern tools like Google OR-Tool or Monash University MiniZinc [1],[2],[3].

[1] Past:

https://hn.algolia.com/?query=Computational%20Complexity%20o...

[2] Logic, Optimization, and Constraint Programming: A Fruitful Collaboration - John Hooker - CMU (2023) [video]:

https://www.youtube.com/live/TknN8fCQvRk

[3] Google OR-Tools:

https://developers.google.com/optimization

[4] MiniZinc:

https://www.minizinc.org/