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

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

Publisher： Edp Sciences

E-ISSN： 1290-385x|47|4|315-324

ISSN： 0988-3754

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

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

A hybrid genetic algorithm for the vehicle routing problem with three-dimensional loading constraints

By Miao Lixin   Ruan Qingfang   Woghiren Kevin   Ruo Qi  

RAIRO - Operations Research, Vol. 46, Iss. 1, 2012-05 ,pp. : 63-82

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

Square-root rule of two-dimensional bandwidth problem∗

By Lin Lan   Lin Yixun  

RAIRO - Theoretical Informatics and Applications, Vol. 45, Iss. 4, 2012-01 ,pp. : 399-411

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

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

By Ünal Ali Nadi   Kayakutlu Gülgün  

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

Edp Sciences

Access to resources Recommend Favorite