Package topics.greedy.agentsTasks

package topics.greedy.agentsTasks

Execution-time benchmarks for greedy agents-to-tasks assignment.

Classes in this package run the greedy AgentsTasks algorithm against randomly generated and varied input sizes to provide empirical performance data.

Classes in This Package

• AgentsTasksDifferentSizesTimes — benchmark across increasing problem sizes
• AgentsTasksRandomValues — benchmark with random cost matrices

Related Packages

Package	Description
topics.greedy	Greedy algorithms — globally optimal solutions through locally optimal choices.

Classes

Class	Description
AgentsTasksDifferentSizesTimes	GREEDY ALGORITHM PROBLEM: THE PROBLEM OF ASSIGNING N TASK TO AGENTS This program serves to increase the size of the execution times of the problem and to check the quadratic behavior expected O(n^2)
AgentsTasksRandomValues	GREEDY ALGORITHM PROBLEM: THE PROBLEM OF ASSIGNING N TASK TO AGENTS This program serves to randomly generate a matrix of costs (the size is introduced by the user).