A new ant colony optimization algorithm for the multidimensional Knapsack problem
Year of publication: |
2008
|
---|---|
Authors: | Kong, Min ; Tian, Peng ; Kao, Yucheng |
Published in: |
Computers & operations research : and their applications to problems of world concern ; an international journal. - Oxford [u.a.] : Elsevier, ISSN 0305-0548, ZDB-ID 194012-0. - Vol. 35.2008, 8, p. 2672-2683
|
Subject: | Algorithmus | Algorithm | Theorie | Theory | Ganzzahlige Optimierung | Integer programming | Mathematische Optimierung | Mathematical programming | Heuristik | Heuristics | Branch-and-Bound | Branch and Bound |
-
Branch and solve strategies-based algorithm for the quadratic multiple knapsack problem
Aïder, Méziane, (2022)
-
A branch and price algorithm for the SS/TDMA problem with cardinality constraint
Colombo, Fabio, (2013)
-
Heuristic algorithms for the general nonlinear separable knapsack problem
D'Ambrosio, Claudia, (2011)
- More ...
-
Bacterial foraging optimization approach to portfolio optimization
Kao, Yucheng, (2013)
-
A PSO-based approach to cell formation problems with alternative process routings
Kao, Yucheng, (2012)
-
Automatic clustering for generalised cell formation using a hybrid particle swarm optimisation
Kao, Yucheng, (2014)
- More ...