An iterative pseudo-gap enumeration approach for the multidimensional Multiple-choice Knapsack Problem
Year of publication: |
1 July 2017
|
---|---|
Authors: | Gao, Chao ; Lu, Guanzhou ; Yao, Xin ; Li, Jinlong |
Published in: |
European journal of operational research : EJOR. - Amsterdam : Elsevier, ISSN 0377-2217, ZDB-ID 243003-4. - Vol. 260.2017, 1 (1.7.), p. 1-11
|
Subject: | Integer programming | Heuristics | Multidimensional Multiple-choice Knapsack | Reduced cost constraint | Ganzzahlige Optimierung | Theorie | Theory | Heuristik |
-
Heuristic concentration and tabu search : a nose to nose comparison
Rosing, K. E., (1997)
-
A heuristic approach to the warehouse management problem : a real case study
Mezghani, Salma, (2012)
-
Using decomposition to improve greedy solutions of the optimal diversity management problem
Agra, Agostinho, (2013)
- More ...
-
An efficient local search heuristic with row weighting for the unicost set covering problem
Gao, Chao, (2015)
-
Beszámoló a 14. Pénzügyi piacok likviditása című konferenciáról
Huszár, Zsuzsa Réka, (2024)
-
Housing Prices, Investments and Macroeconomic Fluctuations
Ma, Wei, (2017)
- More ...