The interval subset sum problem

DOI10.1080/02331939008843544MaRDI QIDQ4712969zbMATH OpenOpenAlexFDO

Authors

Publication date 25 June 1992

Published in Optimization (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1080/02331939008843544

zbMATH Keywords

polynomial complexityknapsackinterval subset sum problemK-th largest subsetsubset sum search

Mathematics Subject Classification ID

Integer programming (90C10) Abstract computational complexity for mathematical programming problems (90C60)

Recommendations

• Subset-sum problems with different summands: Computation
• On variations of the subset sum problem
• On the expressiveness of subset-sum representations
• scientific article; zbMATH DE number 4149895
• A new fully polynomial time approximation scheme for the interval subset sum problem

Cites work

• scientific article; zbMATH DE number 3495856 (Why is no real title available?)
• scientific article; zbMATH DE number 3639144 (Why is no real title available?)
• A Procedure for Computing the K Best Solutions to Discrete Optimization Problems and Its Application to the Shortest Path Problem

Cited in

(3)

• Extracting constrained 2-interval subsets in 2-interval sets
• Interval Stabbing Problems in Small Integer Ranges
• New pseudopolynomial complexity bounds for the bounded and other integer knapsack related problems

This page was built for publication: The interval subset sum problem

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4712969)