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...

Full description

Bibliographic Details

Published in:	European journal of operational research Vol. 270; no. 2; pp. 435 - 447
Main Authors:	Halman, Nir, Kellerer, Hans, Strusevich, Vitaly A.
Format:	Journal Article
Language:	English
Published:	Elsevier B.V 16.10.2018
Subjects:	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 Access:	Get full text
Tags:	Add Tag No Tags, Be the first to tag this record!