A Binary differential search algorithm for the 0-1 multidimensional knapsack problem
The multidimensional knapsack problem (MKP) is known to be NP-hard in operations research and it has a wide range of applications in engineering and management. In this study, we propose a binary differential search method to solve 0-1 MKPs where the stochastic search is guided by a Brownian motion-...
| Main Authors: | , , , , |
|---|---|
| Format: | Journal Article |
| Published: |
Elsevier
2014
|
| Online Access: | http://purl.org/au-research/grants/arc/LP140100873 http://hdl.handle.net/20.500.11937/27975 |