NotesFAQContact Us
Search Tips
Back to results
Peer reviewed Peer reviewed
Direct linkDirect link
ERIC Number: EJ753903
Record Type: Journal
Publication Date: 2006-Jul-15
Pages: 9
Abstractor: Author
ISSN: ISSN-0020-739X
Absolute Points for Multiple Assignment Problems
Adlakha, V.; Kowalski, K.
International Journal of Mathematical Education in Science & Technology, v37 n5 p543-551 Jul 2006
An algorithm is presented to solve multiple assignment problems in which a cost is incurred only when an assignment is made at a given cell. The proposed method recursively searches for single/group absolute points to identify cells that must be loaded in any optimal solution. Unlike other methods, the first solution is the optimal solution. The algorithm provides the user with both an insight into the problem and the ability to critically analyse the data. It is easy to apply and can provide an effective tool for practitioners to solve problems of any size. (Contains 3 tables.)
Taylor & Francis, Ltd. 325 Chestnut Street Suite 800, Philadelphia, PA 19106. Tel: 800-354-1420; Fax: 215-625-2940; Web site:
Publication Type: Journal Articles; Reports - Descriptive
Education Level: N/A
Audience: N/A
Language: English
Sponsor: N/A
Authoring Institution: N/A