Skip to main content
Springer Nature Link
Log in

Heuristics to Convex Quadratic Knapsack Problems in Sorted ADP

  • Conference paper
Intelligent Computing (ICIC 2006)

Part of the book series: Lecture Notes in Computer Science ((LNTCS,volume 4113))

Included in the following conference series:

  • 1719 Accesses

Abstract

Approximate dynamic programming (ADP) was developed for solving large-scale optimization problems, and function approximation is an important method in the dynamic programming scheme. Continuous quadratic programming relaxation (CQPR) and the integral parts of the solutions to CQPR are two intuitionistic heuristics as function approximations in ADP for solving quadratic knapsack problems (QKPs). We propose a rule of ordering variables to sort the first variable to be solved in ADP, and develop a heuristic which adaptively fixes the variables according to the solution to CQPR of convex QKPs based the rule. By using the rule and heuristics, we propose a sorted ADP heuristic scheme for QKPs.

Supported by Program for New Century Excellent Talents in University of China (Grant No.: NCET-04-0570), NSFC (Grant No.: 70571073) and the Specialized Research Fund for the Doctoral Programme of Higher Education (Grant No.: 20050358002).

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Log in via an institution

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Similar content being viewed by others

References

  1. Hua, Z.S., Banerjee, P.: Aggregate Line Capacity Design for PWB Assembly Systems. Int. J. Prod. Res. 38, 2417–2441 (2000)

    Article  MATH  Google Scholar 

  2. Ferreira, C.E., Martin, A., De, S.C., Weismantel, R., Wolsey, L.: Formulations and Valid Inequalities for the Node Capacitated Graph Partitioning Problem. Math. Program. 74, 247–267 (1996)

    MATH  Google Scholar 

  3. Hammer, P.L., Rader, D.J.: Efficient Methods for Solving Quadratic 0-1 Knapsack Problems. Infor 35, 170–182 (1997)

    MATH  Google Scholar 

  4. Cooper, L., Cooper, M.W.: Introduction to Dynamic Programming. Pergamon Press, Elmsford (1981)

    MATH  Google Scholar 

  5. Zhang, B., Hua, Z.S.: An Improved Lemke Algorithm for Convex Quadratic Programming with Equality Constraints. Journal of University of Science and Technology of China 34, 668–677 (2004)

    MathSciNet  Google Scholar 

  6. Hua, Z.S., Zhang, B., Liang, L.: An Approximate Dynamic Programming Approach to Convex Quadratic Knapsack Problems. Comput. Oper. Res., 660–673 (2006)

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. School of Management, University of Science & Technology of China, Hefei, Anhui, 230026, People’s Republic of China

    Bin Zhang & Zhongsheng Hua

Authors
  1. Bin Zhang
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Zhongsheng Hua
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Institute of Intelligent Machines, Chinese Academy of Sciences, Hefei, Anhui, China

    De-Shuang Huang

  2. Carnegie Mellon University,  

    Kang Li

  3. School of Electronics, Electrical Engineering and Computer Science, Queen’s University Belfast, Stranmillis Road, BT9 5AH, Belfast, UK

    George William Irwin

Rights and permissions

Reprints and permissions

Copyright information

© 2006 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Zhang, B., Hua, Z. (2006). Heuristics to Convex Quadratic Knapsack Problems in Sorted ADP. In: Huang, DS., Li, K., Irwin, G.W. (eds) Intelligent Computing. ICIC 2006. Lecture Notes in Computer Science, vol 4113. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11816157_109

Download citation

  • DOI: https://doi.org/10.1007/11816157_109

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-37271-4

  • Online ISBN: 978-3-540-37273-8

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics