On a discrete nonlinear and nonseparable knapsack problem

In this paper, a discrete knapsack problem with a convex but nonseparable objective function is considered. Relaxing the discrete requirements (and assuming nonnegativity), we show how the resulting problem can be solved by an efficient algorithm which solves a series of quadratic knapsack problems...

Ausführliche Beschreibung

Bibliographische Detailangaben

Veröffentlicht in:	Operations research letters 1990, Vol.9 (4), p.233-237
1. Verfasser:	Klastorin, T.D.
Format:	Artikel
Sprache:	eng
Schlagworte:	Applied sciences Exact sciences and technology knapsack problem Mathematical programming nonlinear programming Operational research and scientific management Operational research. Management science
Online-Zugang:	Volltext
Tags:	Tag hinzufügen Keine Tags, Fügen Sie den ersten Tag hinzu!