A Partheno-Genetic Algorithm for Dynamic 0-1 Multidimensional Knapsack Problem∗

E-ISSN： 1290-3868|50|1|47-66

ISSN： 0399-0559

Source： RAIRO - Operations Research, Vol.50, Iss.1, 2015-10, pp. : 47-66

Disclaimer: Any content in publications that violate the sovereignty, the constitution or regulations of the PRC is not accepted or approved by CNPIEC.

Previous Menu Next

Abstract

Related content

Logic Gate-based Evolutionary Algorithm for the multidimensional knapsack problem-wireless sensor network application

By Ferjani Ayet Allah Liouane Noureddine Borne Pierre

RAIRO - Operations Research, Vol. 50, Iss. 4-5, 2016-11 ,pp. : 825-843

Edp Sciences

Access to resources Recommend Favorite

An improved binary search algorithm for the Multiple-Choice Knapsack Problem∗

By He Cheng Leung Joseph Y-T. Lee Kangbok Pinedo Michael L.

RAIRO - Operations Research, Vol. 50, Iss. 4-5, 2016-11 ,pp. : 995-1001

Edp Sciences

Access to resources Recommend Favorite

Solving the simple plant location problem by genetic algorithm

By Kratica Jozef Tošic Dušan Filipović Vladimir Ljubić Ivana

RAIRO - Operations Research, Vol. 35, Iss. 1, 2010-03 ,pp. : 127-142

Edp Sciences

Access to resources Recommend Favorite

Integer Programming Formulation of the Bilevel Knapsack Problem

By Mansi R.

Mathematical Modelling of Natural Phenomena , Vol. 5, Iss. 7, 2010-08 ,pp. : 116-121

Edp Sciences

Access to resources Recommend Favorite

A note on a two dimensional knapsack problem with unloading constraints∗

By Moisés da Silveira Jefferson Luiz Xavier Eduardo Candido Miyazawa Flávio Keidi

RAIRO - Theoretical Informatics and Applications, Vol. 47, Iss. 4, 2013-11 ,pp. : 315-324

Edp Sciences

Access to resources Recommend Favorite