Exact Algorithm for Concave Knapsack Problems: Linear Underestimation and Partition Method

ISSN： 0925-5001

Source： Journal of Global Optimization, Vol.33, Iss.1, 2005-09, pp. : 15-30

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 Branch-and-Bound Algorithm for Concave Network Flow Problems

By Fontes Dalila Hadjiconstantinou Eleni Christofides Nicos

Journal of Global Optimization, Vol. 34, Iss. 1, 2006-01 ,pp. : 127-155

Springer Publishing Company

Access to resources Recommend Favorite

An exact algorithm for team orienteering problems

By Boussier Sylvain

4OR: Quarterly journal of the Belgian, French and Italian operations research societies, Vol. 5, Iss. 3, 2007-09 ,pp. : 211-230

Springer Publishing Company

Access to resources Recommend Favorite

Greedy continuous particle swarm optimisation algorithm for the knapsack problems

By Shen Xianjun Li Yanan Chen Caixia Yang Jincai Zhang Dabin

International Journal of Computer Applications in Technology, Vol. 44, Iss. 2, 2012-08 ,pp. : 137-144

Inderscience Publishers

Access to resources Recommend Favorite

Algorithms to solve some problems of concave programming with linear constraints

By Sergeev S.

Automation and Remote Control, Vol. 68, Iss. 3, 2007-03 ,pp. : 399-412

MAIK Nauka/Interperiodica

Access to resources Recommend Favorite

A New Successive Partition Algorithm for Concave Minimization Based on Cone Decomposition and Decomposition Cuts

By Porembski Marcus

Journal of Global Optimization, Vol. 29, Iss. 2, 2004-06 ,pp. : 191-224

Springer Publishing Company

Access to resources Recommend Favorite