frontpage.
newsnewestaskshowjobs

Open Source @Github

fp.

RIP, Harvest

https://aphyr.com/posts/427-rip-harvest
112•zdw•2h ago•37 comments

KetchUp – Open-source SketchUp alternative built with Rust and WebGPU

https://ketchup3d.github.io/app/
313•dcoulmbe•5h ago•86 comments

Unlocking any car from X brand in most of the world

https://shubs.io/unlocking-any-car-from-x-brand-in-most-of-the-world/
151•infosecau•4h ago•52 comments

A Critique of GPUI

https://blog.zortax.de/posts/a-critique-of-gpui
8•ByteAtATime•42m ago•1 comments

Chimera Vocal Synth

https://chimera-vocal-synth.vercel.app/
141•nmstoker•5h ago•22 comments

Outlook.com Is Quietly Rejecting Email from Domains Without DMARC

https://mailroute.net/blog/outlook-rejecting-email-without-dmarc
307•xmddmx•9h ago•210 comments

I'm not convinced the AI bubble exists

https://matteoraso.github.io/im-not-convinced-the-ai-bubble-exists.html#im-not-convinced-the-ai-b...
88•matteoraso•4h ago•117 comments

Declarative Dragging

https://declarative-dragging.github.io/
421•smusamashah•4d ago•53 comments

Dux: Free, open-source Wayland desktop shell with file manager and theming

https://duxlabs.dev/
226•indigodaddy•9h ago•71 comments

Ask HN: What are you working on? (November 2026)

166•david927•7h ago•565 comments

Nvidia CEO Jensen Huang's letter to staff about affair

https://nvidianews.nvidia.com/news/a-message-to-our-company
419•karimf•6h ago•459 comments

Show HN: JavaScript web apps with WASM layout and GPU rendering in 280 KB

https://github.com/rkaehn/uniform
10•rkaehn•1d ago•2 comments

When a language's creator and its owners strongly disagree [pdf]

https://isocpp.org/files/papers/P4454R0.pdf
97•acossta•5h ago•77 comments

The Qlobe: Rotating Quine (2010)

http://mamememo.blogspot.com/2010/09/qlobe.html
7•niceguitars•1h ago•0 comments

A Bit about Email

https://maurycyz.com/misc/email/
10•vinhnx•1h ago•1 comments

The Web Is More Than Enough, by Paul Ford

https://ftrain.com/aboard-the-web-is-more-than-enough
100•edward•8h ago•56 comments

Goldman Sachs is pulling Claude Code from its bankers and traders

https://www.thestateofai.com/news/goldman-sachs-claude-code-traders-bankers
669•TheWiggles•10h ago•381 comments

Ask HN: How do you manage your AI agents' context across clients and projects?

16•Michel_Aventin•1d ago•18 comments

Branching Beyond Leonardo: The Evolution of Tree Architecture Theory

https://blue-continuum.com/branching-beyond-leonardo
4•dnetesn•2d ago•0 comments

Llama-modchip: 284B DeepSeek on 64GB RAM, no GPU

https://github.com/synchopate/llama-modchip
388•joshcsimmons•18h ago•174 comments

Taco: The Tensor Algebra Compiler

http://tensor-compiler.org/
13•measurablefunc•5d ago•1 comments

Writing as a thinking tool

http://muratbuffalo.blogspot.com/2026/11/writing-as-thinking-tool.html
308•jruohonen•17h ago•83 comments

The History of Djgpp (1998)

https://www.delorie.com/djgpp/history.html
58•atan2•5d ago•22 comments

How I Fight AI Brain Fry

https://sergeykuhne.com/blog/fighting-ai-brain-fry
188•kyunez•8h ago•148 comments

Air holes turn silicon wafers into flat UV focusing mirrors for compact optics

https://phys.org/news/2026-11-air-holes-silicon-wafers-flat.html
35•bookofjoe•1d ago•5 comments

Playing with the STM32MP2

https://serd.es/2026/11/08/playing-with-stm32mp2.html
47•dverlaeckt80•9h ago•31 comments

Goodbye Claude, hello Pi

https://caleb.software/posts/claude-to-pi.html
716•karagenit•1d ago•445 comments

Show HN: Vegetable Gardening for Engineers

https://jrcpl.us/contrib/2020/gardening-for-engineers/
178•jrcplus•4d ago•35 comments

JIT bitmap text rendering for microcontrollers

https://linebender.org/blog/jit-bitmap-text/
95•dmit•17h ago•20 comments

Edward Hopper's Iconic Painting, "Nighthawks

https://lithub.com/the-story-behind-edward-hoppers-iconic-painting-nighthawks/
85•prismatic•4d ago•28 comments
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/