frontpage.
newsnewestaskshowjobs

Made with ♥ by @iamnishanth

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•11mo ago

Comments

buildsjets•11mo 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•11mo 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•11mo ago
(2003)
throw0101b•11mo 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•11mo ago
Are there any public, open, comprehensive datasets on flights?
dieselerator•11mo 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•11mo 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•11mo 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•11mo 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•11mo 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/

Google releases Gemma 4 open models

https://deepmind.google/models/gemma/gemma-4/
1102•jeffmcjunkin•8h ago•333 comments

Tailscale's new macOS home

https://tailscale.com/blog/macos-notch-escape
304•tosh•6h ago•153 comments

Decisions that eroded trust in Azure – by a former Azure Core engineer

https://isolveproblems.substack.com/p/how-microsoft-vaporized-a-trillion
245•axelriet•8h ago•75 comments

Artemis II's toilet is a moon mission milestone

https://www.scientificamerican.com/article/artemis-iis-toilet-is-a-moon-mission-milestone/
122•1659447091•22h ago•48 comments

Cursor 3

https://cursor.com/blog/cursor-3
270•adamfeldman•6h ago•236 comments

Qwen3.6-Plus: Towards real world agents

https://qwen.ai/blog?id=qwen3.6
419•pretext•10h ago•147 comments

Every Law a Commit – US Law in GitHub

https://v1d0b0t.github.io/blog/posts/2026-03-29-every-law-a-commit.html
26•nickvido•1h ago•15 comments

Good ideas do not need lots of lies in order to gain public acceptance (2008)

https://blog.danieldavies.com/2004/05/d-squared-digest-one-minute-mba.html
144•sedev•7h ago•64 comments

George Goble has died

https://www.legacy.com/us/obituaries/wlfi/name/george-goble-obituary?id=61144779
102•finaard•6h ago•19 comments

Lemonade by AMD: a fast and open source local LLM server using GPU and NPU

https://lemonade-server.ai
435•AbuAssar•13h ago•96 comments

ParadeDB (YC S23) Is Hiring Database Internal Engineers (Rust)

https://paradedb.notion.site/
1•philippemnoel•2h ago

The Australian government has announced gambling advertising reforms

https://www.bbc.com/news/articles/c62492e925lo
88•gostsamo•6h ago•63 comments

LinkedIn is searching your browser extensions

https://browsergate.eu/
1545•digitalWestie•11h ago•678 comments

Memo: A language that remembers only the last 12 lines of code

https://danieltemkin.com/Esolangs/Memo/
17•notem•2h ago•0 comments

Prefer do notation over Applicative operators when assembling records (2024)

https://haskellforall.com/2024/05/prefer-do-notation-over-applicative
19•wazHFsRy•2d ago•2 comments

JSON Canvas Spec (2024)

https://jsoncanvas.org/spec/1.0/
81•tobr•3d ago•28 comments

OpenAI Acquires TBPN

https://openai.com/index/openai-acquires-tbpn/
140•surprisetalk•7h ago•123 comments

A Few Good Magazines From the 70s and 80s

https://www.bi6.us/CO/MG.HTML
10•OhMeadhbh•1h ago•1 comments

Significant progress made on Xbox 360 recompilation

https://readonlymemo.com/rexglue-xbox-360-recompilation-interview/
58•tetrisgm•4d ago•15 comments

Maze Algorithms

https://www.astrolog.org/labyrnth/algrithm.htm
6•marukodo•2d ago•2 comments

Significant raise of reports

https://lwn.net/Articles/1065620/
275•stratos123•15h ago•147 comments

Inside Nepal's Fake Rescue Racket

https://kathmandupost.com/money/2026/03/27/inside-nepal-s-fake-rescue-racket
248•lode•13h ago•113 comments

The Beginning of Programming as We'll Know It

https://bitsplitting.org/2026/04/01/the-beginning-of-programming-as-well-know-it/
8•zdw•1d ago•0 comments

Artemis computer running two instances of MS outlook; they can't figure out why

https://bsky.app/profile/nikigrayson.com/post/3miik2wzosk25
302•mooreds•9h ago•228 comments

Queueing Requests Queues Your Capacity Problems, Too

https://pushtoprod.substack.com/p/queueing-requests-queues-your-capacity-problems-too
13•mhawthorne•3d ago•5 comments

Show HN: Made a little Artemis II tracker

https://artemis-ii-tracker.com/
19•codingmoh•1h ago•5 comments

'Backrooms' and the Rise of the Institutional Gothic

https://thereader.mitpress.mit.edu/backrooms-and-the-rise-of-the-institutional-gothic/
169•anarbadalov•11h ago•77 comments

Magic the Gathering Deck Shuffler

https://mtg.jessitron.honeydemo.io/
31•mooreds•3d ago•14 comments

Foxing aspires to be an eBPF-powered replication engine for Linux filesystems

https://codeberg.org/aenertia/foxing
34•tanelpoder•3d ago•4 comments

Sweden goes back to basics, swapping screens for books in the classroom

https://undark.org/2026/04/01/sweden-schools-books/
734•novaRom•14h ago•377 comments