- Jeff Dean이 소개한, Carl de Marcken의 Computational Complexity of Air Travel Planning PDF 읽기. 읽는중인데 정말 재밌다. https://x.com/JeffDean/status/1913693986771906613
- 다가오는 Coldplay 콘서트를 같이 가기 위한 Itinerary짜기 (출발새서 점심먹고 픽업하고 주차장찾아서 입차하고 저녁먹고 공연보고 출차하고 도착하기인데, 2명으로 시작해서 3명과 4명이 되었다가 다시 3명과 2명이 되어야 하는, 고객*이 원하는 조건을 만족해야하는)
"An analogy is that if fares are atoms, priceable units are the molecules used to build complete tickets. It's not entirely correct, but a good working intuition is that a priceable unit is the smallest group of flights and fares that could be sold on their own." "Fare rules are expressed in an extremely complicated and baroque electronic language, built from hundreds of parameterized predicates joined by sometimes bizarre logical combinators"
If you have a fediverse account, you can reply to this note from your own instance. Search https://hackers.pub/ap/notes/019651e0-657e-7df7-b521-ebedf49fa91e on your instance and reply to it.
"For a travel query, find the best solution: A set of flights that satisfies the travel query, A set of fares that covers all the flights exactly once, A partition of the fares into priceable units. For each fare, solution must satisfy fare's rules."