A new fully polynomial time approximation scheme for the interval subset sum problem

The interval subset sum problem (ISSP) is a generalization of the well-known subset sum problem. Given a set of intervals [ a i , 1 , a i , 2 ] i = 1 n and a target integer T , the ISSP is to find a set of integers, at most one from each interval, such that their sum best approximates the target T b...

Full description

Saved in:
Bibliographic Details
Published in:Journal of global optimization Vol. 68; no. 4; pp. 749 - 775
Main Authors: Diao, Rui, Liu, Ya-Feng, Dai, Yu-Hong
Format: Journal Article
Language:English
Published: New York Springer US 01.08.2017
Springer
Springer Nature B.V
Subjects:
Approximation
Comparative analysis
Complexity
Computer Science
Computer simulation
Integers
Knapsack problem
Mathematical analysis
Mathematics
Mathematics and Statistics
Numerical analysis
Operations Research/Decision Theory
Optimization
Production scheduling
Real Functions
68Q25
Solution structure
Fully polynomial time approximation scheme
90C59
Interval subset sum problem
Computational complexity
Worst-case performance
ISSN:0925-5001, 1573-2916
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary:The interval subset sum problem (ISSP) is a generalization of the well-known subset sum problem. Given a set of intervals [ a i , 1 , a i , 2 ] i = 1 n and a target integer T , the ISSP is to find a set of integers, at most one from each interval, such that their sum best approximates the target T but cannot exceed it. In this paper, we first study the computational complexity of the ISSP. We show that the ISSP is relatively easy to solve compared to the 0–1 knapsack problem. We also identify several subclasses of the ISSP which are polynomial time solvable (with high probability), albeit the problem is generally NP-hard. Then, we propose a new fully polynomial time approximation scheme for solving the general ISSP problem. The time and space complexities of the proposed scheme are O n max 1 / ϵ , log n and O n + 1 / ϵ , respectively, where ϵ is the relative approximation error. To the best of our knowledge, the proposed scheme has almost the same time complexity but a significantly lower space complexity compared to the best known scheme. Both the correctness and efficiency of the proposed scheme are validated by numerical simulations. In particular, the proposed scheme successfully solves ISSP instances with n = 100 , 000 and ϵ = 0.1 % within 1 s.
Bibliography:ObjectType-Article-1
SourceType-Scholarly Journals-1
ObjectType-Feature-2
content type line 14
ISSN:0925-5001
1573-2916
DOI:10.1007/s10898-017-0514-0