An exact algorithm for the Knapsack Problem with Setup

ISSN： 1745-7645

Source： International Journal of Operational Research, Vol.5, Iss.3, 2009-05, pp. : 280-291

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 algorithm for the disjunctively constrained knapsack problem

By Hi? Mhand Otmani Nabil

International Journal of Operational Research, Vol. 13, Iss. 1, 2012-12 ,pp. : 22-43

Inderscience Publishers

Access to resources Recommend Favorite

Hybrid algorithms for the Multiple-choice Multi-dimensional Knapsack Problem

By Cherfi Nawal Hifi Mhand

International Journal of Operational Research, Vol. 5, Iss. 1, 2009-04 ,pp. : 89-109

Inderscience Publishers

Access to resources Recommend Favorite

New greedy heuristics for the Multiple-choice Multi-dimensional Knapsack Problem

By Hiremath Chaitr S. Hill Raymond R.

International Journal of Operational Research, Vol. 2, Iss. 4, 2007-06 ,pp. : 495-512

Inderscience Publishers

Access to resources Recommend Favorite

A Lagrangean relaxation approach for capacitated lot sizing problem with setup times

By Cheng Chun-Hung Madan Manohar S. Motwani Jaideep Yip Ka-Yun

International Journal of Operational Research, Vol. 18, Iss. 3, 2013-09 ,pp. : 272-303

Inderscience Publishers

Access to resources Recommend Favorite

A heuristic algorithm for the fixed charge problem

By Adlakha Veena

OPSEARCH, Vol. 47, Iss. 2, 2010-06 ,pp. : 1-10

Springer Publishing Company

Access to resources Recommend Favorite