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/

My favourite PowerMac is a Nintendo Wii

https://virtuallyfun.com/2026/10/29/my-favourite-powermac-is-a-nintendo-wii/
297•DHowett•14h ago•81 comments

Tell HN: Scribd Breached

169•x______________•5h ago•67 comments

Cloudflare Turnstile solver library (no headless browser required)

https://github.com/chris124567/cfsolve
177•costco•2d ago•51 comments

The $6.3B Binance hack was pulled off in just 20 minutes

https://www.wired.com/story/the-dollar63-billion-binance-hack-was-pulled-off-in-just-20-minutes/
425•domhudson•19h ago•286 comments

Northflank Breached

https://status.northflank.com
420•js4ever•16h ago•311 comments

Breaking the open web won't stop the bad bots

https://www.techpolicy.press/breaking-the-open-web-wont-stop-the-bad-bots/
250•raybb•3d ago•106 comments

Longitudinal Changes InWearable-Captured PhysiologyBefore Sudden Cardiac Death

https://www.jacc.org/doi/epdf/10.1016/j.jaccas.2026.110397
25•brandonb•2d ago•11 comments

Show HN: Samosa – Linter for Math Derivations

https://samosa-math.vercel.app
9•Hussain04•3d ago•0 comments

Show HN: A working Nintendo in ~1GB of Qwen weights

https://github.com/dbreunig/nesformer
239•dbreunig•15h ago•120 comments

The oldest ice disappears and the Stone Age emerges from it

https://www.sciencenorway.no/archaeology-climate-culture/the-oldest-ice-is-disappearing-the-stone...
136•dxs•12h ago•56 comments

Show HN: To Honor Sir Patrick Stewart, Enjoy the TNG Episode Guessing Game

https://tng.episodle.com/
181•francisofascii•8h ago•49 comments

Sanstun: A sans-IO, parallel-friendly WireGuard implementation in Rust

https://www.firezone.dev/blog/introducing-sanstun
120•wh33zle•10h ago•20 comments

Infinite Mac: BeOS

https://blog.persistent.info/2026/10/infinite-mac-beos.html
146•ecliptik•12h ago•58 comments

Florilegium: Procedural Flowers in LaTeX

https://github.com/kevinraymond/florilegium
257•nanna•16h ago•45 comments

Configure a UPS on Linux with NUT

https://linuxjunkies.org/guides/configure-a-ups-with-nut
13•eustoria•1d ago•0 comments

Backdoor in Claude Code for VS Code extension on the Cursor Marketplace

https://phorion.io/blog/offical-claude-code-vsx-compromise/
875•_chall•1d ago•514 comments

The federated code forge

https://tangled.org/blog/forge/
275•zlliang•16h ago•84 comments

Jules Verne's Lost Novel

https://blue-continuum.com/verne-paris
101•dnetesn•12h ago•23 comments

Cisco gives engineer unlimited AI tokens to rewrite legacy code

https://fortune.com/2026/10/30/cisco-president-jeetu-patel-gen-z-27-year-old-unlimited-ai-tokens-...
171•taubek•17h ago•204 comments

Azure's Weakest Link – Five Full Cross-Tenant Compromises

https://www.binarysecurity.no/posts/2026/10/one-root-case
303•swq115•21h ago•58 comments

Brief History of PDP Computers

https://entropicthoughts.com/history-of-pdp-computers
17•ibobev•1d ago•5 comments

Double Buffering with Cloudflare Queues

https://bellone.com/technical/double-buffering-with-cloudflare-queues
26•b_llc•2d ago•3 comments

Through Captain Jean-Luc Picard, Patrick Stewart taught us the measure of a man

https://www.bostonglobe.com/2026/10/29/metro/patrick-stewart-picard-star-trek-the-next-generation/
292•apress•11h ago•166 comments

Trapped in the Technologist Factory

https://ideolalia.com/essays/trapped-in-the-technologist-factory.html
30•luu•2d ago•10 comments

Building an AI-native engineering org

https://twitter.com/sgondala2/status/2115832070274723875
146•sgondala_ycapp•1d ago•177 comments

Turning a solar power system into its own backup

https://arstechnica.com/science/2026/10/turning-a-solar-power-system-into-its-own-backup/
45•PaulHoule•1d ago•15 comments

Sleep framework: A new way for LLMs to retain knowledge in continual learning

https://research.google/blog/the-sleep-framework-a-new-way-for-llms-to-retain-knowledge-in-contin...
219•acossta•2d ago•24 comments

Tree-mounted machines connect to web app to let users knock on wood remotely

https://www.designboom.com/technology/tree-mounted-machines-web-app-users-knock-on-wood-remotely/
84•surprisetalk•3d ago•35 comments

AI isn't replacing SREs, it's deskilling them

https://newsletter.signoz.io/p/ai-isnt-replacing-sres-its-deskilling
574•dorianniemiec•16h ago•421 comments

How do you take a picture of a black hole?

https://www.quantamagazine.org/how-do-you-take-a-picture-of-a-black-hole-20261029/
95•dverlaeckt80•22h ago•69 comments