A best first search exact algorithm for the Multiple-choice Multidimensional Knapsack Problem

Sbihi, A (2007) A best first search exact algorithm for the Multiple-choice Multidimensional Knapsack Problem. Journal of Combinatorial Optimization, 13 (4). pp. 337-351. ISSN 1382-6905

Full text not available from this repository.
Item Type: Journal Article
Journal or Publication Title: Journal of Combinatorial Optimization
Uncontrolled Keywords: /dk/atira/pure/subjectarea/aacsb/disciplinebasedresearch
Subjects:
Departments: Lancaster University Management School > Management Science
ID Code: 44906
Deposited By: ep_importer_pure
Deposited On: 11 Jul 2011 18:23
Refereed?: Yes
Published?: Published
Last Modified: 28 Aug 2019 01:19
URI: https://eprints.lancs.ac.uk/id/eprint/44906

Actions (login required)

View Item View Item