News for hackers. Stuff that matters.
Re:Computational Complexity of Air Travel Planning (2003) [pdf] by peterjmag on Thursday January 22, 2015 @01:29PM (#8930746)
I found that last page with the BOS-HNL-LAX-PWM-BOS circle query really fascinating for a couple of different reasons: 1) the fact that ITA could already do this in 2003, and 12 years later, most flight search engines still can't handle that kind of query, and 2) that a very similar itinerary today is less than half the price[1].

(As a side note, how awesome is it that you can deep-link to a specific fare on Google Flights?)

[1] https://www.google.de/flights/?gl=US#search;iti=BOS_HNL_2015...

Re:Computational Complexity of Air Travel Planning (2003) [pdf] by monksy on Thursday January 22, 2015 @03:52PM (#8931669)
Re:Computational Complexity of Air Travel Planning (2003) [pdf] by misterbwong on Thursday January 22, 2015 @05:38PM (#8932246)
Doesn't hipmunk use ITA's routing engine?
Re:Computational Complexity of Air Travel Planning (2003) [pdf] by jpatokal on Thursday January 22, 2015 @10:05PM (#8933178)
Yes, they do.