Skip to main navigation Skip to search Skip to main content

Heuristics for the General Multiple Non-linear Knapsack Problem

  • Laboratoire d'Informatique (LIX)
  • Chemin de la Malmaison
  • DEI “Guglielmo Marconi”

Research output: Contribution to journalArticlepeer-review

3 Citations (Scopus)

Abstract

We propose heuristic algorithms for the multiple non-linear knapsack problem with separable non-convex profit and weight functions. First, we design a fast constructive algorithm that provides good initial solutions. Secondly, we improve the quality of these solutions through local search procedures. We compare the proposed methods with exact and heuristic algorithms for mixed integer non-linear programming problems, proving that our approach provides good-quality solutions in smaller CPU time.

Original languageEnglish
Pages (from-to)69-72
Number of pages4
JournalElectronic Notes in Discrete Mathematics
Volume55
DOIs
Publication statusPublished - 1 Nov 2016

Keywords

  • Heuristic algorithm
  • Local search
  • Mixed-integer non-linear programming
  • Multiple non-linear knapsack problem

Fingerprint

Dive into the research topics of 'Heuristics for the General Multiple Non-linear Knapsack Problem'. Together they form a unique fingerprint.

Cite this