Pages that link to "Item:Q5955091"
From MaRDI portal
The following pages link to An exact algorithm for the subset sum problem (Q5955091):
Displaying 10 items.
- An optimal and scalable parallelization of the two-list algorithm for the subset-sum problem (Q852950) (← links)
- Parallel time and space upper-bounds for the subset-sum problem (Q955010) (← links)
- An improved balanced algorithm for the subset-sum problem (Q1713739) (← links)
- Optimal parallel machines scheduling with availability constraints (Q1775061) (← links)
- An integrated cutting stock and sequencing problem (Q2643965) (← links)
- A Mixture of Dynamic Programming and Branch-and-Bound for the Subset-Sum Problem (Q3220352) (← links)
- Solving Medium-Density Subset Sum Problems in Expected Polynomial Time: An Enumeration Approach (Q3507347) (← links)
- An output-sensitive Algorithm to partition a Sequence of Integers into Subsets with equal Sums (Q5377219) (← links)
- AI*IA 2003: Advances in Artificial Intelligence (Q5897319) (← links)
- Algebraic algorithms for variants of subset sum (Q6102280) (← links)