Cost Based Filtering for the Constrained Knapsack Problem

ISSN： 0254-5330

Source： Annals of Operations Research, Vol.115, Iss.1-4, 2002-09, pp. : 73-93

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

Optimal sampling for estimation with constrained resources using a learning automaton-based solution for the nonlinear fractional knapsack problem

By Granmo Ole-Christoffer Oommen B.

Applied Intelligence, Vol. 33, Iss. 1, 2010-08 ,pp. : 3-20

Springer Publishing Company

Access to resources Recommend Favorite

LP based heuristics for the multiple knapsack problem with assignment restrictions

By Dahl Geir

Annals of Operations Research, Vol. 146, Iss. 1, 2006-09 ,pp. : 91-104

Springer Publishing Company

Access to resources Recommend Favorite

Constrained and quantized Kalman filtering for an RFID robot localization problem

By Boccadoro Mauro

Autonomous Robots, Vol. 29, Iss. 3-4, 2010-11 ,pp. : 235-251

Springer Publishing Company

Access to resources Recommend Favorite

Knapsack problem with probability constraints

By Gaivoronski Alexei Lisser Abdel Lopez Rafael Xu Hu

Journal of Global Optimization, Vol. 49, Iss. 3, 2011-03 ,pp. : 397-413

Springer Publishing Company

Access to resources Recommend Favorite

Cost-based Filtering for Shorter Path Constraints

By Sellmann Meinolf Gellermann Thorsten Wright Robert

Constraints, Vol. 12, Iss. 2, 2007-06 ,pp. : 207-238

Springer Publishing Company

Access to resources Recommend Favorite