Publication | Closed Access

An optimal and scalable parallelization of the two-list algorithm for the subset-sum problem

Mathematical ProgrammingEngineeringParallel Complexity TheoryTwo-list AlgorithmAnalysis Of AlgorithmCombinatorial ProblemScalable ParallelizationComputational ComplexityParallel ProgrammingComputer ScienceDiscrete MathematicsParallel ComputingCombinatorial OptimizationDiscrete OptimizationParallel MetaheuristicsParallel AlgorithmsSubset-sum Problem