frontpage.
newsnewestaskshowjobs

Open Source @Github

fp.

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/

Show HN: Open-source engine running Gemma 4 26B in 2 GB RAM on any M-series Mac

https://github.com/drumih/turbo-fieldfare
148•gitpusher42•1h ago•33 comments

KOReader

https://koreader.rocks/
473•Cider9986•5h ago•153 comments

Handbook.md shows that long policy documents do not reliably govern agents

https://arxiv.org/abs/2607.25398
174•spIrr•3h ago•105 comments

Hugging Face: Anatomy of a frontier-lab agent intrusion

https://huggingface-anatomy-of-frontier-lab-model-intrusion.static.hf.space/index.html
46•dn2k•1h ago•7 comments

Launch HN: Tokenless (YC S26) – Automatic model switching to save money

https://usetokenless.com/
14•rohaga•35m ago•5 comments

Superlogical – Mitchell Hashimoto

https://mitchellh.com/writing/superlogical
20•tambourine_man•45m ago•1 comments

Hamburg's Stadtpark: A Park Built to Be Used

https://alsterrunde.com/hamburgs-stadtpark-a-park-built-to-be-used/
20•mertbio•2d ago•1 comments

Shipping Godot VR and Porting to PSVR2: A Partial Post Mortem

https://www.claire-blackshaw.com/blog/2026/07/shipping-godot-vr-and-porting-to-psvr2-a-partial-po...
57•ibobev•3h ago•0 comments

Hunter-gatherers introduced fish to a mountain lake 7000 years ago

https://www.newscientist.com/article/2580119-hunter-gatherers-introduced-fish-to-a-mountain-lake-...
76•stevenwoo•2d ago•50 comments

Darktable

https://www.darktable.org/
134•siatko•3h ago•68 comments

Cesium DevCon 2026 talks are up, including a keynote from SQLite's creator

https://cesium.com/events/cesium-developer-conference/2026/
15•jasteinerman•1h ago•1 comments

Mitchellh starts a new company: Superlogical

https://www.superlogical.com/
14•yan•49m ago•0 comments

Document-borne AI worms can self-propagate through Copilot for Word

https://enklypesalt.com/posts/context-collapse-part3-ai-worming-through-word/
204•Canopy9560•4h ago•174 comments

More Tailscale tricks for your jailbroken Kindle

https://tailscale.com/blog/jailbroken-kindle-proxy-tun-modes
347•Error6571•11h ago•100 comments

Self-hosting Kimi K3: 20% more hardware cost, 20% better task resolution

https://aistack.imec-int.com/blog/gpu-self-hosting
20•flifenstein•1h ago•4 comments

Amiga Graphics Archive

https://amiga.lychesis.net/index.html
110•Bluestein•6h ago•17 comments

GPT-5.6 vs. Claude Fable 5 for Physical AI, which performs best?

https://juliahub.com/blog/frontier-models-physical-ai-evaluation
24•mbauman•1h ago•4 comments

Disrupting supply chain attacks on NPM and GitHub Actions

https://github.blog/security/supply-chain-security/disrupting-supply-chain-attacks-on-npm-and-git...
59•nyku•4h ago•18 comments

AI in Linux

https://drewdevault.com/blog/AI-in-Linux/
26•surprisetalk•2h ago•18 comments

Show HN: Qwen Scribe – local transcription and dictation for Apple Silicon

https://github.com/VladUZH/qwen-scribe
16•sidclaw•1h ago•3 comments

User Interfaces of the Demo Scene

https://www.datagubbe.se/scenegui/
343•zdw•12h ago•57 comments

SQLite in Production: Optimizing WAL Mode, Concurrency, and VFS Layers

https://micrologics.org/blog/sqlite-in-production-optimizing-wal-mode-concurrency-and-vfs-layers-...
192•ankitg12•9h ago•58 comments

Ask HN: My domain registrar (Hover) rug-pulled me for $3000

18•shrinks99•44m ago•10 comments

SpecForge – A Platform for Authoring Formal Specifications

https://docs.imiron.io/v/0.5.10/en/tour.html
61•agnishom•5h ago•7 comments

A.I. Companies Are Recruiting Electricians and Carpenters by the Thousands

https://www.nytimes.com/2026/07/29/business/economy/data-center-electricians-training.html
54•thm•1h ago•37 comments

Show HN: Write, simulate and synthesize VHDL/Verilog in the browser

https://risingedge.pro
14•wozniakpawel•6d ago•4 comments

Lisp moving Forth moving Lisp

https://letoverlambda.com/textmode.cl/guest/chap8.html
93•fallat•2d ago•22 comments

A Texture Lookup Approach to Bézier Curve Evaluation on the GPU (JCGT)

https://jcgt.org/published/0015/02/01/
29•ibobev•3h ago•4 comments

Baseload Is a Myth (2024)

https://cleanenergyreview.io/p/baseload-is-a-myth
4•thecopy•50m ago•0 comments

Google shuts down Nobel Prize winning AlphaFold

https://www.engadget.com/2225849/google-shuts-down-alphafold/
34•NordStreamYacht•1h ago•2 comments