Abstract
The minimax linear assignment problem with additional linear constraints is studied. An exact polynomial time algorithm is developed, verified and validated in case of a single added constraint. In case of multiple constraints, the problem is more complex and becomes NP-hard. A tree search technique is proposed. Some computational studies are reported.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have