African Journal of
Mathematics and Computer Science Research

  • Abbreviation: Afr. J. Math. Comput. Sci. Res.
  • Language: English
  • ISSN: 2006-9731
  • DOI: 10.5897/AJMCSR
  • Start Year: 2008
  • Published Articles: 261

Full Length Research Paper

Knapsack problem: A case study of garden city radio (GCR), Kumasi, Ghana

Peasah O. K.1, Amponsah S. K.2 and Asamoah D.3*
        1Department of Computer Science, Kwame Nkrumah University of Science and Technology, Kumasi, Ghana. 2Department of Mathematics, Kwame Nkrumah University of Science and Technology, Kumasi, Ghana. 3Department of Information Systems and Decision Sciences, Kwame Nkrumah University of Science and Technology, School of Business, Kumasi, Ghana.        
Email: [email protected]

  •  Accepted: 05 October 2010
  •  Published: 30 April 2011

Abstract

 

Packing or arrangement problems form an integral part in a man’s life and cannot be out rightly ignored. Items need to be well arranged and protected to survive the move unscathed. When it is done efficiently, at least to its optimal level, space is saved. A room may become spacious when furniture, bags and other household items are arranged very well. The end result is beauty and attractiveness. Radio stations, need to arrange different types of adverts in order to maximize air time. In this paper, the knapsack problem is employed in selecting adverts to be played on air from a pile of adverts, using the garden city radio, as case study.

 

Key words: Knapsack, packing, adverts, heuristics scheme.