Sentence examples for the generalized assignment from inspiring English sources

We propose truthful approximation mechanisms for strategic variants of the generalized assignment problem (GAP) in a payment-free environment.

We formulate versions of the knapsack problem, the generalized assignment problem and the bin-packing problem with sigmoid utilities.

This paper presents algorithms based on differential evolution (DE) to solve the generalized assignment problem (GAP) with the objective to minimize the assignment cost under the limitation of the agent capacity.

The former problem is extended from the generalized assignment problem by changing resource consumptions, capacity constraints and costs of jobs over time; and the latter one is a well-known synthetic problem that generates and updates a multidimensional landscape consisting of several peaks.

Our optimization core entails a combinatorial problem that is a multi-period variant of the Generalized Assignment Problem: we design a Branch-and-Price algorithm that, although exact in nature, performs well also as a matheuristics when combined with early stopping.

The generalized assignment problem now is to find a maximum weighted ℓ-partitioning (with respect to a suitable weighting scheme); we will treat ℓ as a variable that is to be maximized along with the actual partitioning.

In this paper, follows from practical point of view in real systems, the GAP is extended to the equilibrium generalized assignment problem (EGAP) and the equilibrium constrained generalized assignment problem (ECGAP).

We validate performance of our method by considering both the dynamic generalized assignment problem and the moving peaks benchmark.

The well-known generalized assignment problem (GAP) is to minimize the costs of assigning n jobs to m capacity constrained agents (or machines) such that each job is assigned to exactly one agent.

The planning problem is converted into a generalized assignment problem, given a linear programming formulation, and solved using the IBM ILOG CPLEX Optimizer.

The commonly observed phenomenon of pseudo-division leads us to formalize the problem of aligning two consecutive frames as a generalized assignment problem.