We review academic research on dual-sourcing (or dual-mode) dynamic stochastic inventory models, which study the replenishment of inventory from two sources (or two transportation modes) in the presence of demand uncertainty. The classic assumption, also adopted here, is that the two sources...

Given an input graph Gin =(V,E_in), we consider the problem of designing a sparse subgraph G = (V, E) with E ⊆ E_in that supports a large matching after some nodes in V are randomly deleted. We study three families of sparse graph designs (namely, Clusters, Rings, and Erdős-Rényi graphs) and...