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/

Since Chromium 148, Math.tanh is now fingerprintable to link underlying OS

https://scrapfly.dev/posts/browser-math-os-fingerprint/
247•joahnn_s•3h ago•121 comments

Cyberpunk Comics, Manga and Graphic Novels

https://shellzine.net/cyberpunk-comics/
36•zdw•1h ago•7 comments

Tiny Emulators

https://floooh.github.io/tiny8bit-preview/index.html
117•naves•4h ago•3 comments

So you want to learn physics (second edition, 2021)

https://www.susanrigetti.com/physics
72•azhenley•4d ago•5 comments

Designing and assembling my first PCB

https://vilkeliskis.com/b/2026/0711.html
19•tadasv•1h ago•2 comments

Ask HN: What Are You Working On? (July 2026)

47•david927•3h ago•118 comments

Migrating a production AI agent to GPT-5.6: 2.2x faster, 27% cheaper

https://ploy.ai/blog/migrating-a-production-ai-agent-to-gpt-5-6
116•brryant•7h ago•36 comments

Claude Code sends 33k tokens before reading the prompt; OpenCode sends 7k

https://systima.ai/blog/claude-code-vs-opencode-token-overhead
435•systima•6h ago•244 comments

Kode Dot Programmable pocket device for makers, pentesters and geeks

https://kode.diy
33•iNic•2h ago•6 comments

Architecture Description Languages [pdf]

https://ics.uci.edu/~taylor/documents/2000-ADLs-TSE.pdf
12•ascent817•1h ago•1 comments

Old and new apps, via modern coding agents

https://terrytao.wordpress.com/2026/07/11/old-and-new-apps-via-modern-coding-agents/
402•subset•13h ago•114 comments

How we can reduce traffic congestion

https://research.google/blog/the-power-of-collaboration-how-we-can-reduce-traffic-congestion/
61•raahelb•8h ago•54 comments

Circular Obstacle Pathfinding (2017)

https://redblobgames.github.io/circular-obstacle-pathfinding/
4•andsoitis•44m ago•0 comments

I Learned to Read Again

https://substack.magazinenongrata.com/p/how-i-learned-to-read-again
81•georgex7•6h ago•39 comments

Why write code in 2026

https://softwaredoug.com/blog/2026/07/09/write-code
97•softwaredoug•2d ago•142 comments

Mechanistic interpretability researchers applying causality theory to LLMs

https://cacm.acm.org/news/can-we-understand-how-large-language-models-reason/
79•adunk•6h ago•62 comments

LARP – Revenue infrastructure for serious founders

https://www.larp.website/
135•BerislavLopac•7h ago•32 comments

Profiling the "Abundance" housing bottleneck with real data

https://laxmena.com/same-capacity-less-throughput
13•laxmena•2h ago•3 comments

A Speed Limit for Computers

https://caolan.uk/notes/2026-07-02_a_speed_limit_for_computers.cm
12•zdw•1h ago•10 comments

Billion Dollar PDFs

https://billiondollarpdf.com/
3•rafaepta•41m ago•0 comments

Automation Without Understanding

https://arxiv.org/abs/2607.06377
84•root-parent•7h ago•38 comments

Against Usefulness

https://www.motivenotes.ai/p/against-usefulness
79•supo•6h ago•21 comments

Irish datacenters now guzzle 23% of the country's electricity

https://www.theregister.com/on-prem/2026/07/11/irish-datacenters-now-guzzle-23-of-the-countrys-el...
201•Bender•4h ago•174 comments

Flash-MSA: Accelerating Million-Token Training with Sparse Attention Kernels

https://nanduruganesh.github.io/flash-msa/
16•rawsh•3h ago•0 comments

The One-Step Trap (In AI Research)

http://incompleteideas.net/IncIdeas/OneStepTrap.html
41•jxmorris12•5h ago•7 comments

I love LLMs, I hate hype

https://geohot.github.io//blog/jekyll/update/2026/07/12/i-love-llms.html
294•therepanic•5h ago•178 comments

Deir El-Medina Strikes

https://en.wikipedia.org/wiki/Deir_el-Medina_strikes
60•mooreds•5d ago•14 comments

Show HN: Agent Draw: An agent draws while you talk, built on TLDraw

https://techstackups.com/articles/tldraw-agent-draw/
44•jameswhitford•6d ago•15 comments

Why Vanilla JavaScript

https://guseyn.com/html/posts/why-vanilla-js.html
5•guseyn•1h ago•1 comments

How to read more books

https://scotto.me/blog/2026-07-12-how-to-read-more-books/
248•silcoon•8h ago•140 comments