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/

Discovery Loop

https://www.discoveryloop.com/
598•xtreak29•9h ago•383 comments

Zed DeltaDB

https://zed.dev/deltadb
304•ahamez•7h ago•156 comments

The title cards in Blade Runner are amazing

https://randsinrepose.com/archives/blade-runner-title-cards/
144•ExMachina73•4h ago•62 comments

Changes at Google DeepMind: Demis Hassabis from CEO to Chair, Jeff Dean departs

https://blog.google/company-news/inside-google/message-ceo/next-chapter-ai-momentum/
476•colesantiago•9h ago•593 comments

Muse Code and Muse Spark 1.2

https://research.meta.ai/blog/introducing-muse-code-and-muse-spark-1-2
177•paulkrush•6h ago•105 comments

Beating GPT-5.6 Sol on retrieval with 100x cheaper open models

https://neon.com/blog/how-castform-neon-beats-frontier-models-on-price-and-efficiency
226•moonikakiss•7h ago•47 comments

Prime Agent: A self-improving RLM agent

https://www.primeintellect.ai/blog/prime-agent
105•Xeophon•4h ago•19 comments

Atlassian Rovo Exfiltrates Data, Bypassing Controls

https://www.promptarmor.com/resources/atlassian-rovo-exfiltrates-data
170•hackerBanana•8h ago•67 comments

Born Against, or why hobby programming communities are against LLM usage

https://blog.fogus.me/llm/born-against.html
131•lladnar•7h ago•141 comments

NVIDIA’s Vera Whitepaper Has a Thread Loose

https://chipsandcheese.com/p/nvidias-vera-whitepaper-has-a-thread
85•pella•4h ago•13 comments

I'll be stepping back from leading product for X

https://twitter.com/nikitabier/status/2085105586966827343/
60•DearAll•4h ago•79 comments

Cloudflare OS: an open platform for agents, apps, and work

https://blog.cloudflare.com/cloudflare-os/
472•speckx•11h ago•237 comments

Branchless Rust: Making a Filter 4x Faster by Removing an If

https://www.greyblake.com/blog/branchless-rust/
13•greyblake•2d ago•0 comments

Something is changing in the unit economics of software

https://nicolo.xyz/something-is-changing-in-the-unit-economics-of-software/
27•coconido•9h ago•20 comments

I'm switching my phone from Android to Linux

https://runarcn.no/android-to-linux/
209•speckx•6h ago•173 comments

GNU Hurd News 2026-Q2

https://www.gnu.org/software/hurd/news/2026-q2.html
126•plaguna•3d ago•91 comments

Celld: Self-hosted, distributed Durable Objects

https://github.com/denoland/celld
145•calvinfo•9h ago•25 comments

Exact, parallel 2D Delaunay triangulation for int32 coordinates

https://github.com/morishuz/delaunay32
32•oryx1729•5d ago•1 comments

Position: LLMs Can't Jump

https://openreview.net/challenge?redirect=%2Fforum%3Fid%3DklU4737opt
244•theanonymousone•14h ago•166 comments

Pushing the limits of RISC-V emulation

https://shuklaayu.sh/blog/riscv-recompiler
23•shuklaayush•1w ago•8 comments

Goodhart's Law Comes for Every Benchmark You Trust

https://cacm.acm.org/blogcacm/goodharts-law-comes-for-every-benchmark-you-trust/
62•pseudolus•5d ago•30 comments

Launch HN: HyperProbe (YC S26) – Agents that do read-only debugging in prod

https://www.hyperprobe.co
44•shailendraht•9h ago•31 comments

Discovery of a multicomponent alloy forged by the Hiroshima atomic blast

https://www.science.org/doi/10.1126/sciadv.aeg8299
111•_____k•6d ago•48 comments

The Origins of Vintage Comics Part 1

https://www.truegrittexturesupply.com/blogs/news/origins-of-the-vintage-comics-aesthetic-part-1
9•Michelangelo11•6d ago•1 comments

The Entropy of a Markov Chain

https://chillphysicsenjoyer.substack.com/p/the-entropy-of-a-markov-chain
105•surprisetalk•11h ago•9 comments

Sycophantic AI Decreases Prosocial Intentions and Promotes Dependence (2025)

https://arxiv.org/abs/2510.01395
73•robin_reala•7h ago•53 comments

Online Friends Are Real Friends

https://toska.bearblog.dev/re-online-friends-are-real-friends/
66•Tomte•5d ago•47 comments

The Valley of Webhooks

https://weli.dev/blog/the-valley-of-webhooks/
154•weli•10h ago•73 comments

What happens if you put work into the second dimension?

https://norbertkozsir.com/posts/work-in-the-second-dimension/
50•abelsm•7h ago•43 comments

Sula: A Gemini protocol server written in Scryer Prolog

https://sagredo.dev/projects/sula/
45•triska•7h ago•2 comments