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!

Be the first to leave a comment!