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

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

Publisher： Edp Sciences

E-ISSN： 1290-3868|51|3|627-637

ISSN： 0399-0559

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

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

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

Genetic and Tabu search algorithms for peptide assembly problem

By Błażewicz Jacek   Borowski Marcin   Formanowicz Piotr   Głowacki Tomasz  

RAIRO - Operations Research, Vol. 44, Iss. 2, 2010-04 ,pp. : 153-166

Edp Sciences

Access to resources Recommend Favorite

New representation to reduce the search space for the resource-constrained project scheduling problem

By Moumene Khaled   Ferland Jacques A.  

RAIRO - Operations Research, Vol. 42, Iss. 2, 2008-05 ,pp. : 215-228

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