Van Gog et al. [20] examined four different conditions: worked-examples only, example-problem pairs, problem-example pairs, and problem solving only.
The crew pairing problem (CPP) finds a set of pairings (sequences of flights separated by connections or rests starting and ending at the same crew base) that covers a set of flights at minimum cost.
Input output pairing problem, in the presence of uncertainties, and its consequences on the pairing problem have not been widely addressed.
For multivariate predictive controller, selection of predictive horizon is an input-output pairing problem.
Further, we propose O(n2k log nk) α nk)) time algorithms for finding the closest and furthest pair problems, and present a lower bound of Ω(n2) for the closest pair problem when k is constant.
While motivated by scattering theory and quantum graphs, our present focus is on the Fuglede-spectral pair problem.
Hence, non-conventional time curves offer altenative solution as time curve design is determined for each relay coordination pair problem.
In particular, the closest pair problem, the exact and approximate post-office problem, and the problem of constructing spanners are discussed in detail.
As an application of the new non-overlap result, we solve the spectral-pair problem for Bernoulli convolutions advancing in this way a theorem of Ka-Sing Lau.
The proposed BAB method is illustrated through a biobjective pairing problem using selection criteria involving the relative gain array and the μ-interaction measure.
This paper shows a solution approach for an integrated fleet-assignment, aircraft-routing and crew-pairing problem covering the flights of a single day.
