The interval subset sum problem

DOI10.1080/02331939008843544zbMath0735.90047OpenAlexW2076796385MaRDI QIDQ4712969

No author found.

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)

Related Items (1)

New pseudopolynomial complexity bounds for the bounded and other integer knapsack related problems

Cites Work

• A Procedure for Computing the K Best Solutions to Discrete Optimization Problems and Its Application to the Shortest Path Problem
• Unnamed Item
• Unnamed Item

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