A hybrid reactive search for solving the max-min knapsack problem with multi-scenarios
International journal of computers and applications ; 40 , 1 ; 1-13
2018-01-01
13 pages
Aufsatz (Zeitschrift)
Englisch
DDC: | 004.05 |
© Metadata Copyright the British Library Board and other contributors. All rights reserved.
Scatter Search for the 0–1 Multidimensional Knapsack Problem
British Library Online Contents | 2008
|Solving large-scale 0-1 knapsack problem by the social-spider optimisation algorithm
British Library Online Contents | 2018
|Solving the pickup and delivery problem with time windows using reactive tabu search
Online Contents | 2000
|British Library Online Contents | 2004
|Knapsack frame of knapsack type home elevator and elevator equipped with knapsack frame
Europäisches Patentamt | 2023
|