Math & Numbers
Textbook Hungarian algorithm for 2–8 × 2–8 assignment problems: row/column reductions, augmenting-path zero matching, König line covers, and substitution-verified optimal assignments.
Call this tool from your code in three languages.
curl -X POST 'http://127.0.0.1:3003/en/api/tools/assignment-problem-solver' \
-H 'Content-Type: application/json' \
-d '{"matrix":"9, 2, 7\n6, 4, 3\n5, 8, 1","goal":"min","decimalPlaces":4}'Send a POST request with your inputs as JSON. File parameters require a separate upload first.
POST http://127.0.0.1:3003/en/api/tools/assignment-problem-solver| Name | Type | Required | Description |
|---|---|---|---|
| matrix | textarea | Yes | Cost (or benefit) matrix, one row per worker, one column per task. 2–8 rows × 2–8 columns; rectangular matrices are padded with zero-cost dummies. |
| goal | select | Yes | — |
| decimalPlaces | number | No | — |
Text result
{
"result": "Processed text content",
"error": "Error message (optional)",
"message": "Notification message (optional)",
"metadata": {
"key": "value"
}
}Add this tool to your Model Context Protocol server so AI agents can list and call it.
Add this block to your MCP client configuration:
{
"mcpServers": {
"elysiatools-assignment-problem-solver": {
"name": "assignment-problem-solver",
"description": "Textbook Hungarian algorithm for 2–8 × 2–8 assignment problems: row/column reductions, augmenting-path zero matching, König line covers, and substitution-verified optimal assignments.",
"baseUrl": "http://127.0.0.1:3003/mcp/sse?toolId=assignment-problem-solver",
"command": "",
"args": [],
"env": {},
"isActive": true,
"type": "sse"
}
}
}After connecting to the SSE endpoint, list the exposed tools:
{
"jsonrpc": "2.0",
"id": 1,
"method": "tools/list"
}Invoke the tool by its id, passing arguments built from its parameters:
{
"jsonrpc": "2.0",
"id": 2,
"method": "tools/call",
"params": {
"name": "assignment-problem-solver",
"arguments": {
"matrix": "9, 2, 7\n6, 4, 3\n5, 8, 1",
"goal": "min",
"decimalPlaces": 4
}
}
}Questions or issues? Contact [email protected]