simultaneously. An online algorithm A is called (ρ1,ρ2)-competitive for minimizing f1 and f2 if A is ρ1-competitive for minimizing f1 … and ρ2-competitive for minimizing f2. A (ρ1,ρ2)-competitive online algorithm A is called nondominated if there is no other … (ρ1′,ρ2′)-competitive online algorithm A′ such that (ρ1′,ρ2′)≤(ρ1,ρ2) and either ρ1′<ρ1 or ρ2′<ρ2. …

-and-bound algorithm that uses the linear programming lower bound outperforms the previously best algorithm. …

exhibits less bias than previous estimators. Computational theory, algorithm, and publicly available code based in R are …Extending the theory of lower bounds to reliability based on splits given by Guttman (in Psychometrika 53, 63 …

propose a customized branch-and-bound algorithm for solving the subproblem based on its similarities with the Linear Multiple … Choice Knapsack Problem. Further we present a Lagrange Relaxation algorithm for finding this lower bound. To the best of our …