On tightening 0-1 programs based on extensions ofpure 0-1 knapsack and subset-sum problems

Author： L S P

ISSN： 0254-5330

Source： Annals of Operations Research, Vol.81, Iss.1, 1998-01, pp. : 379-404

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

The 0-1 knapsack problem with fuzzy data

By Kasperski Adam Kulej Michał

Fuzzy Optimization and Decision Making, Vol. 6, Iss. 2, 2007-06 ,pp. : 163-172

Springer Publishing Company

Access to resources Recommend Favorite

Improved convergent heuristics for the 0-1 multidimensional knapsack problem

By Hanafi Saïd

Annals of Operations Research, Vol. 183, Iss. 1, 2011-03 ,pp. : 125-142

Springer Publishing Company

Access to resources Recommend Favorite

The Multidimensional 0-1 Knapsack Problem—Bounds and Computational Aspects

By Fréville Arnaud

Annals of Operations Research, Vol. 139, Iss. 1, 2005-10 ,pp. : 195-227

Springer Publishing Company

Access to resources Recommend Favorite

Solving 0-1 knapsack problem by continuous ACO algorithm

By Changdar Chiranjit Mahapatra G.S. Pal Rajat Kumar

International Journal of Computational Intelligence Studies, Vol. 2, Iss. 3-4, 2013-11 ,pp. : 333-349

Inderscience Publishers

Access to resources Recommend Favorite

Global optimality conditions for quadratic 0-1 optimization problems

By Chen Wei Zhang Liansheng

Journal of Global Optimization, Vol. 46, Iss. 2, 2010-02 ,pp. : 191-206

Springer Publishing Company

Access to resources Recommend Favorite