Global ETD Search

Search theses and dissertations gathered from participating repositories worldwide. Every result links back to the library that holds it. No account is needed.

Results

Showing 1 to 3 of 3 for “"Minmax Regret"”.

  1. Analysis of approximation and uncertainty in optimization

    … Finally, we consider a randomized model for minmax regret in combinatorial optimization under cost uncertainty. This problem can be viewed as a zero-sum game played between an optimizing player and an adversary, where the optimizing player selects a solution and the adversary selects costs …

    mit Repository record for Analysis of approximation and uncertainty in optimization (opens in a new tab)

  2. Supervised classification and network location problems via mathematical optimization

    … only a known interval estimation. We propose a minmax regret model where the service facility can be located anywhere along the network. Furthermore, we present two polynomial algorithms for finding the location that minimizes the maximal regret assuming that the demand realization is an unknown …

    cadiz Repository record for Supervised classification and network location problems via mathematical optimization (opens in a new tab)

  3. Robust Post-donation Blood Screening under Limited Information

    Blood products are essential components of any healthcare system, and their safety, in terms of being free of transfusion-transmittable infections, is crucial. While the Food and Drug Administration (FDA) in the United States requires all blood donations to be tested for a set of infections, it …

    vt Repository record for Robust Post-donation Blood Screening under Limited Information (opens in a new tab)