hungarian_assign
Solve the assignment problem by optimally assigning workers to tasks using the Hungarian algorithm. Provide an NxN cost matrix and optionally set maximize to true.
Instructions
Solve the assignment problem (optimally assign N workers to N tasks) using the Hungarian algorithm.
Tool call template
Replace each placeholder with a value matching the input schema. Only required parameters are included; add optional parameters as needed.
{
"id": 1,
"jsonrpc": "2.0",
"method": "tools/call",
"params": {
"arguments": {
"cost_matrix": "<cost_matrix>"
},
"name": "hungarian_assign"
}
}Input Schema
| Name | Required | Description | Default |
|---|---|---|---|
| maximize | No | Maximize instead of minimize (default false) | |
| cost_matrix | Yes | NxN cost matrix |