title: Can I use the Hungarian algorithm to find max cost?
body: <p>The Hungarian algorithm solves the assignment problem in polynomial time. Given  workers and tasks, and an n×n matrix containing the cost of assigning each worker to a task, it can find the cost minimizing assignment. </p>
  
  <p>I want to find the choice for which cost is max? Can I do it using Hungarian or any similar method? Or this can only be done exponentially? </p>