Approximation schemes for non-separable non-linear boolean programming problems under nested knapsack constraints

•A model suitable for handling take-or-leave decisions is introduced.•The objective is a non-linear non-separable function.•The constraints are nested linear knapsack constraints.•Fully polynomial-time approximation schemes are presented and analysed.•Approaches: geometric rounding and K-approximati...

Ausführliche Beschreibung

Bibliographische Detailangaben

Veröffentlicht in:	European journal of operational research Jg. 270; H. 2; S. 435 - 447
Hauptverfasser:	Halman, Nir, Kellerer, Hans, Strusevich, Vitaly A.
Format:	Journal Article
Sprache:	Englisch
Veröffentlicht:	Elsevier B.V 16.10.2018
Schlagworte:	Combinatorial optimization FPTAS Geometric rounding K-approximation sets and functions Non-linear boolean programming K-approximation sets and functions Non-linear boolean programming Geometric rounding Combinatorial optimization FPTAS
ISSN:	0377-2217, 1872-6860
Online-Zugang:	Volltext
Tags:	Tag hinzufügen Keine Tags, Fügen Sie den ersten Tag hinzu!