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

Comments

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

Statement from Dario Amodei on our discussions with the Department of War

https://www.anthropic.com/news/statement-department-of-war
1658•qwertox•9h ago•851 comments

The Hunt for Dark Breakfast

https://moultano.wordpress.com/2026/02/22/the-hunt-for-dark-breakfast/
166•moultano•4h ago•60 comments

The normalization of corruption in organizations (2003) [pdf]

https://gwern.net/doc/sociology/2003-ashforth.pdf
6•rendx•1h ago•0 comments

Julia: Performance Tips

https://docs.julialang.org/en/v1/manual/performance-tips/
25•tosh•3d ago•6 comments

What Claude Code chooses

https://amplifying.ai/research/claude-code-picks
378•tin7in•13h ago•153 comments

80386 Protection

https://nand2mario.github.io/posts/2026/80386_protection/
38•nand2mario•2d ago•5 comments

Layoffs at Block

https://twitter.com/jack/status/2027129697092731343
671•mlex•10h ago•703 comments

AirSnitch: Demystifying and breaking client isolation in Wi-Fi networks [pdf]

https://www.ndss-symposium.org/wp-content/uploads/2026-f1282-paper.pdf
350•DamnInteresting•15h ago•163 comments

What does " 2>&1 " mean?

https://stackoverflow.com/questions/818255/what-does-21-mean
249•alexmolas•11h ago•132 comments

Parakeet.cpp – Parakeet ASR inference in pure C++ with Metal GPU acceleration

https://github.com/Frikallo/parakeet.cpp
35•noahkay13•4h ago•4 comments

I rendered 1,418 confusables over 230 fonts. Most aren't confusable to the eye

https://paultendo.github.io/posts/confusable-vision-visual-similarity/
41•paultendo•1d ago•16 comments

Move tests to closed source repo

https://github.com/tldraw/tldraw/issues/8082
42•nilsbunger•1d ago•25 comments

Launch HN: Cardboard (YC W26) – Agentic video editor

https://www.usecardboard.com/
110•sxmawl•13h ago•60 comments

Dear Time Lords: Freeze Computers in 1993

https://graydon2.dreamwidth.org/322461.html
65•zdw•3h ago•29 comments

An Introduction to the Codex Seraphinianus, the Strangest Book Ever Published

https://www.openculture.com/2026/02/an-introduction-to-the-codex-seraphinianus.html
60•vinhnx•3d ago•13 comments

OsmAnd's Faster Offline Navigation (2025)

https://osmand.net/blog/fast-routing/
151•todsacerdoti•13h ago•48 comments

I baked a pie every day for a year

https://www.theguardian.com/lifeandstyle/2026/feb/22/a-new-start-after-60-i-baked-a-pie-every-day...
266•NaOH•3d ago•170 comments

LiteLLM (YC W23): Founding Reliability Engineer – $200K-$270K and 0.5-1.0% equity

https://www.ycombinator.com/companies/litellm/jobs/unlCynJ-founding-reliability-performance-engineer
1•ij23•6h ago

Palm OS User Interface Guidelines (2003) [pdf]

https://cs.uml.edu/~fredm/courses/91.308-spr05/files/palmdocs/uiguidelines.pdf
181•spiffytech•14h ago•87 comments

Hydroph0bia – fixed SecureBoot bypass for UEFI firmware from Insyde H2O (2025)

https://coderush.me/hydroph0bia-part3/
55•transpute•9h ago•1 comments

Museum of Plugs and Sockets

https://plugsocketmuseum.nl/index.html
107•ohjeez•3d ago•37 comments

Smartphone market forecast to decline this year due to memory shortage

https://www.idc.com/resource-center/press-releases/wwsmartphoneforecast4q25/
224•littlexsparkee•9h ago•224 comments

BuildKit: Docker's Hidden Gem That Can Build Almost Anything

https://tuananh.net/2026/02/25/buildkit-docker-hidden-gem/
173•jasonpeacock•17h ago•63 comments

Two insider cases we've recently closed

https://news.kalshi.com/p/kalshi-trading-violation-enforcement-cases
25•fortran77•6h ago•50 comments

The Origins of Agar

https://www.asimov.press/p/agar
4•surprisetalk•3d ago•0 comments

Show HN: Hacker Smacker – Spot great (and terrible) HN commenters at a glance

https://hackersmacker.org
111•conesus•2d ago•126 comments

Show HN: Deff – Side-by-side Git diff review in your terminal

https://github.com/flamestro/deff
97•flamestro•14h ago•54 comments

Understanding the Go Runtime: The Memory Allocator

https://internals-for-interns.com/posts/go-memory-allocator/
59•valyala•3d ago•10 comments

Show HN: Linex – A daily challenge: placing pieces on a board that fights back

https://www.playlinex.com/
61•Humanista75•2d ago•20 comments

This time is different

https://shkspr.mobi/blog/2026/02/this-time-is-different/
156•speckx•18h ago•246 comments