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/asjc/2600/2606

Subjects:

?? control and optimizationdiscrete mathematics and combinatoricscomputational theory and mathematicsapplied mathematicscomputer science applicationsdiscipline-based research ??

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:

15 Jul 2024 12:02

URI:

https://eprints.lancs.ac.uk/id/eprint/44906