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

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

Publisher： Edp Sciences

E-ISSN： 1290-3868|50|4-5|995-1001

ISSN： 0399-0559

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

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

Probabilistic Tabu search with multiple neighborhoods for the Disjunctively Constrained Knapsack Problem

By Ben Salem Mariem   Hanafi Saïd   Taktak Raouia   Ben Abdallah Hanêne  

RAIRO - Operations Research, Vol. 51, Iss. 3, 2017-07 ,pp. : 627-637

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

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 Algorithm for a Bicriteria Batching Scheduling Problem∗

By He Cheng   Wang Xiumei   Lin Yixun   Mu Yundong  

RAIRO - Operations Research, Vol. 47, Iss. 1, 2013-02 ,pp. : 1-8

Edp Sciences

Access to resources Recommend Favorite

An Improved Cuckoo Search for a Patient Transportation Problem with Consideration of Reducing Transport Emissions

By Xiao Liyang   Dridi Mahjoub   Hajjam El Hassani Amir   Fei Hongying   Lin Wanlong  

Sustainability, Vol. 10, Iss. 3, 2018-03 ,pp. : 793-793

MDPI

Access to resources Recommend Favorite