Abstract: Techniques for processing flexible-date queries are described. Techniques include a interface to enter a flexible date query including a description of a traveler's desired stay at a destination. A user receives a set of solutions that satisfy the flexible date query in the form of a calendar. The set of solutions can be stored in a database for eventual retrieval of a subset of the set of solutions to render to a user.

Abstract: Multiple passenger, multiple route processing includes sending independent queries to a travel planning system for each of a plurality of passenger groups, receiving individual solutions and producing a set of tables, each representing a different partial joint solution for each passenger group. For a chosen passenger group, deriving a set of constraints on an individual query for the passenger group, the set of constraints related to the individual solutions and joint travel requirements and constructing a modified individual query, modified according to the derived constraints. The modified individual query for the chosen passenger group is sent to the travel planning system.

Abstract: A multiple routes for multiple passengers are produced by ordering passenger groups and for each passenger group, constructing an individual query and sending the individual query to a travel planning system. Solutions based on the individual query are received from the travel planning system and a single individual solution is selected from the response. Constraints are added to subsequent individual queries based on previously selected individual solutions and joint travel requirements or preferences.

Abstract: A graphical user interface includes a first set of columns for displaying details for a first passenger group, a second set of columns for displaying details for a second passenger group and a third set of columns for displaying details for joint solution properties of a joint solution involving the first and second passenger groups.

Abstract: Multiple passenger multiple route travel queries are solved using travel planning systems that receive multiple, individual queries to produce individual solutions that meet joint travel requirements. The multiple, individual sub-queries are merged to produce joint solutions for the passenger groups.

Abstract: Multiple passenger multiple route techniques are disclosed including sending independent queries to a travel planning system for each of a plurality of passenger groups and receiving lists of individual solutions appropriate for the passenger groups in response to the independent queries. The lists are combined to provide joint solutions according to joint travel requirements/preferences and if there are not a sufficient number of joint solutions, the individual queries are resent with constraints on features of the resent individual queries.

Abstract: A user interface displayed on a computer monitor includes fields for entering data for a multiple passenger, multiple route query, the fields including a first set of fields corresponding to travel segments of a first passenger group, a second set of fields corresponding to travel segments of a second passenger group, and a third set of fields corresponding to shared travel features between the first travel group and second travel group.

Abstract: Determining multiple routes for multiple passenger groups, includes sending to a scheduler, multiple individual queries with a bias to produce individual solutions that meet joint travel requirements, merging results from the multiple individual queries to produce joint solutions for the passenger groups and returning the joint solutions.

Abstract: Techniques for processing a multiple passenger, multiple route query are disclosed. The techniques include a travel planning system that searches for airline tickets in response to queries and a server that sends multiple, individual queries to the travel planning system and combines solutions received from execution of the multiple individual queries by the travel planning system, producing answers for the multiple passenger, multiple route query.

Abstract: A query cache for travel planning includes a cache database that stores query results and a cache test mechanism that receives a travel planning query and uses the query to find a result in the cache database and if a result is found returns the result, the result including a set of answers each answer in the set having a flight and a fare useable with the flight.

Abstract: A query cache for travel planning includes a cache database that stores query results and a cache test mechanism that receives a travel planning query and uses the query to find a result in the cache database and if a result is found returns the result, the result including a set of answers each answer in the set having a flight and a fare useable with the flight.

Abstract: A query cache for travel planning includes a cache database that stores query results and a cache test mechanism that receives a travel planning query and uses the query to find a result in the cache database and if a result is found returns the result, the result including a set of answers each answer in the set having a flight and a fare useable with the flight.

Abstract: A query cache for travel planning includes a cache database that stores query results and a cache test mechanism that receives a travel planning query and uses the query to find a result in the cache database and if a result is found returns the result, the result including a set of answers each answer in the set having a flight and a fare useable with the flight.

Abstract: Techniques for processing flexible-date queries are described. Techniques include a interface to enter a flexible date query including a description of a traveler's desired stay at a destination. A user receives a set of solutions that satisfy the flexible date query in the form of a calendar. The set of solutions can be stored in a database for eventual retrieval of a subset of the set of solutions to render to a user.