Title: Piecewise convex maximization approach to multiknapsack
Abstract: We refine the reverse convex approach to binary programs into a piecewise convex maximization problem with only two pieces. As a vital lead, we address the multiknapsack problem. The results of computational experiments are presented in contrast with the best known solutions found by heuristics and by the reverse convex approach.
Publication Year: 2009
Publication Date: 2009-10-01
Language: en
Type: article
Indexed In: ['crossref']
Access and Citation
Cited By Count: 6
AI Researcher Chatbot
Get quick answers to your questions about the article from our AI researcher chatbot