![Open Access](https://i-scholar.in/lib/pkp/templates/images/icons/fulltextgreen.png)
![Restricted Access](https://i-scholar.in/lib/pkp/templates/images/icons/fulltextred.png)
![Open Access](https://i-scholar.in/lib/pkp/templates/images/icons/fulltextgreen.png)
![Open Access](https://i-scholar.in/lib/pkp/templates/images/icons/fulltext_open_medium.gif)
![Restricted Access](https://i-scholar.in/lib/pkp/templates/images/icons/fulltextred.png)
![Restricted Access](https://i-scholar.in/lib/pkp/templates/images/icons/fulltext_restricted_medium.gif)
An Exact Algorithm for Variant Assignment Problem
Subscribe/Renew Journal
This paper address variant constrained job assignment model. To solve this problem we applied a method called Lexi-Search algorithm. Tests are conducted on randomly generated instances.
Keywords
Assignment Problem, Lexi-Search Algorithm.
User
Subscription
Login to verify subscription
Font Size
Information
![](https://i-scholar.in/public/site/images/abstractview.png)
Abstract Views: 273
![](https://i-scholar.in/public/site/images/pdfview.png)
PDF Views: 1