Approximation schemes for non-separable non-linear Boolean programming problems under nested knapsack constraints
- Submitting institution
-
University of Greenwich
- Unit of assessment
- 11 - Computer Science and Informatics
- Output identifier
- 20042
- Type
- D - Journal article
- DOI
-
10.1016/j.ejor.2018.04.013
- Title of journal
- European Journal of Operational Research
- Article number
- -
- First page
- 435
- Volume
- 270
- Issue
- 2
- ISSN
- 0377-2217
- Open access status
- Compliant
- Month of publication
- April
- Year of publication
- 2018
- URL
-
-
- Supplementary information
-
-
- Request cross-referral to
- -
- Output has been delayed by COVID-19
- No
- COVID-19 affected output statement
- -
- Forensic science
- No
- Criminology
- No
- Interdisciplinary
- No
- Number of additional authors
-
2
- Research group(s)
-
-
- Citation count
- 4
- Proposed double-weighted
- No
- Reserve for an output with double weighting
- No
- Additional information
- In this paper, we show that standard techniques can be applied to develop FPTAs for non-linear, non-separable Boolean programming problems with nested knapsack constraints, generalising previous work on quadratic functions. Two FPTASs for the problem are developed: one using geometric rounding, the other more efficient, uses K-approximation sets and functions. Both techniques have been applied systematically to the DP algorithm. The FPTAS developed has many applications: for instance, the single-item lot-sizing problem is among the most popular problems of combinatorial optimisation. The running times of the approximation schemes compare favourably with known analogues for less general problems.
- Author contribution statement
- -
- Non-English
- No
- English abstract
- -
