in this paper, the bernstein polynomials are used to approximate the solutions of linear integral equations with multiple time lags (iemtl) through expansion methods (collocation method, partition method, galerkin method). the method is discussed in detail and illustrated by solving some numerical examples. comparison between the exact and approximated results obtained from these methods is...

We introduce and motivate several variants of the bin packing problem where bins are assigned to time slots, minimum maximum lags required between some pairs items. suggest two integer programming formulations for general problem: a compact one stronger formulation with an exponential number variables constraints. propose branch-cut-and-price approach that exploits latter formulation. For this ...