[英]Minimizing the maximum cost of job assignment problem
我需要為這個問題開發一個多項式時間算法,但我有點困惑。 我需要最小化任務中的最大成本,而不是所有任務的總成本。 我嘗試使用匈牙利方法,但它找到了最小的總成本,而不是最大值的最小值。
我應該如何 go 關於它?
對權重進行排序,對最小最大值進行二分搜索,通過對不大於候選最大值的邊進行子集化並運行 Hopcroft-Karp 來檢查每個猜測。
[英]Minimizing maximum cost in an one-to-one assignment problem
[英]Minimizing the maximum cost of a task-to-machine assignment
[英]Job assignment with NO cost, would Hungarian method work?
[英]Solve assignment problem without cost matrix?
[英]Assignment problem with 2 workers per job
[英]convert assignment problem to The Maximum Flow Problem
[英]Dynamic programming, minimizing cost?
[英]Assignment problem with multiple persons needed on each job
[英]Minimizing the maximum distance in a graph
[英]Cost minimizing algorithm (time limited)
聲明:本站的技術帖子網頁,遵循CC BY-SA 4.0協議,如果您需要轉載,請注明本站網址或者原文地址。任何問題請咨詢:yoyou2525@163.com.