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

Comments

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

LLMs could be, but shouldn't be compilers

https://alperenkeles.com/posts/llms-could-be-but-shouldnt-be-compilers/
37•alpaylan•1h ago•24 comments

I now assume that all ads on Apple news are scams

https://kirkville.com/i-now-assume-that-all-ads-on-apple-news-are-scams/
359•cdrnsf•2h ago•208 comments

Claude Opus 4.6

https://www.anthropic.com/news/claude-opus-4-6
2125•HellsMaddy•21h ago•912 comments

TikTok's 'Addictive Design' Found to Be Illegal in Europe

https://www.nytimes.com/2026/02/06/business/tiktok-addictive-design-europe.html
206•thm•2h ago•138 comments

Show HN: Agent Arena – Test How Manipulation-Proof Your AI Agent Is

https://wiz.jock.pl/experiments/agent-arena/
41•joozio•2h ago•33 comments

Invention of DNA "Page Numbers" Opens Up Possibilities for the Bioeconomy

https://www.caltech.edu/about/news/invention-dna-page-numbers-synthesis-kaihang-wang
68•dagurp•4h ago•32 comments

The rise of one-pizza engineering teams

https://www.jampa.dev/p/the-rise-of-one-pizza-engineering
15•jampa•4d ago•6 comments

A new bill in New York would require disclaimers on AI-generated news content

https://www.niemanlab.org/2026/02/a-new-bill-in-new-york-would-require-disclaimers-on-ai-generate...
291•giuliomagnifico•5h ago•103 comments

GPT-5.3-Codex

https://openai.com/index/introducing-gpt-5-3-codex/
1399•meetpateltech•20h ago•540 comments

Things Unix can do atomically (2010)

https://rcrowley.org/2010/01/06/things-unix-can-do-atomically.html
180•onurkanbkrc•9h ago•63 comments

Solving Shrinkwrap: New Experimental Technique

https://kizu.dev/shrinkwrap-solution/
15•spiros•11h ago•1 comments

My AI Adoption Journey

https://mitchellh.com/writing/my-ai-adoption-journey
721•anurag•19h ago•277 comments

Nixie-clock using neon lamps as logic elements (2007)

https://www.pa3fwm.nl/projects/neonclock/
16•jacquesm•4d ago•6 comments

Show HN: Smooth CLI – Token-efficient browser for AI agents

https://docs.smooth.sh/cli/overview
22•antves•22h ago•6 comments

Systems Thinking

http://theprogrammersparadox.blogspot.com/2026/02/systems-thinking.html
166•r4um•9h ago•86 comments

DNS Explained – How Domain Names Get Resolved

https://www.bhusalmanish.com.np/blog/posts/dns-explained.html
53•okchildhood•3d ago•12 comments

Plasma Effect (2016)

https://www.4rknova.com/blog/2016/11/01/plasma
62•todsacerdoti•3d ago•11 comments

We tasked Opus 4.6 using agent teams to build a C Compiler

https://www.anthropic.com/engineering/building-c-compiler
609•modeless•19h ago•591 comments

Stay Away from My Trash

https://tldraw.dev/blog/stay-away-from-my-trash
83•EvgeniyZh•3d ago•35 comments

Recreating Epstein PDFs from raw encoded attachments

https://neosmart.net/blog/recreating-epstein-pdfs-from-raw-encoded-attachments/
426•ComputerGuru•1d ago•153 comments

Show HN: Artifact Keeper – Open-Source Artifactory/Nexus Alternative in Rust

https://github.com/artifact-keeper
102•bsgeraci•10h ago•36 comments

Hackers (1995) Animated Experience

https://hackers-1995.vercel.app/
4•todsacerdoti•1h ago•0 comments

Coding Agents and Use Cases

https://justsitandgrin.im/posts/coding-agents-use-cases/
14•vinhnx•3d ago•4 comments

Animated Knots

https://www.animatedknots.com/
267•ostacke•4d ago•35 comments

How to carry more than your own bodyweight (2025)

https://www.bbc.com/future/article/20250124-how-to-carry-more-than-your-own-bodyweight
62•1659447091•3d ago•73 comments

The RCE that AMD won't fix

https://mrbruh.com/amd/
291•MrBruh•15h ago•124 comments

The time I didn't meet Jeffrey Epstein

https://scottaaronson.blog/?p=9534
262•pfdietz•19h ago•322 comments

Unlocking high-performance PostgreSQL with key memory optimizations

https://stormatics.tech/blogs/unlocking-high-performance-postgresql-key-memory-optimizations
74•camille_134•4d ago•5 comments

Orchestrate teams of Claude Code sessions

https://code.claude.com/docs/en/agent-teams
370•davidbarker•21h ago•202 comments

I reversed Tower of Fantasy's anti-cheat driver: a BYOVD toolkit never loaded

https://vespalec.com/blog/tower-of-flaws/
90•svespalec•11h ago•40 comments