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 2 of 2 for “"Multidimensional Multiconstraint Knapsack Problem"”.

  1. The optimal admission & adaptation of service level agreements in packet networks : applying the utility model

    Khan considered the problem of optimal allocation of the resources of a single server, while meeting the Quality of Service (QoS) requirements of users' multimedia sessions. He showed how the problem could be mapped onto a variant of the combinatorial Knapsack Problem, with server utility (e.g. …

    uvic Repository record for The optimal admission & adaptation of service level agreements in packet networks : applying the utility model (opens in a new tab)

  2. Multicommodity flow applied to the utility model: a heuristic approach to service level agreements in packet networks

    … heuristics to solve the Utility Model mapped the problem onto a variant of the Combinatorial Knapsack Problem, with server utility (e.g. revenue) as the quantity to be optimized and with user QoS requirements expressed as constraints on the resource allocation. Both optimal (algorithmic) and fast …

    uvic Repository record for Multicommodity flow applied to the utility model: a heuristic approach to service level agreements in packet networks (opens in a new tab)