A Dynamic Programming Approach for Consistency and Propagation for Knapsack Constraints

Author： Trick M.A.  

Publisher： Springer Publishing Company

ISSN： 0254-5330

Source： Annals of Operations Research, Vol.118, Iss.1-4, 2003-02, pp. : 73-84

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

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

IMPROVED CONVERGENCE THROUGH DYNAMIC PROGRAMMING APPROACH

By Calu Angelica  

Cybernetics and Systems, Vol. 33, Iss. 8, 2002-12 ,pp. : 863-876

Taylor & Francis Ltd

Access to resources Recommend Favorite

Direct back propagation neural dynamic programming-based particle swarm optimisation

By Lu Yongzhong   Yan Danping   Zhang Jingyu   Levy David  

Connection Science, Vol. 26, Iss. 4, 2014-10 ,pp. : 367-388

Taylor & Francis Ltd

Access to resources Recommend Favorite

Finding optimal control policy in probabilistic Boolean Networks with hard constraints by using integer programming and dynamic programming

By Chen Xi  

International Journal of Data Mining and Bioinformatics, Vol. 7, Iss. 3, 2013-04 ,pp. : 321-343

Inderscience Publishers

Access to resources Recommend Favorite

A Bayesian Dynamic Programming approach tooptimal maintenance combined with burn-in

By Nicolato E.   Runggaldier W.J.  

Annals of Operations Research, Vol. 91, Iss. 1, 1999-01 ,pp. : 105-122

Springer Publishing Company

Access to resources Recommend Favorite