Computing Partitions with Applications to the Knapsack Problem
Journal of the ACM (JACM)
Exact algorithms for NP-hard problems: a survey
Combinatorial optimization - Eureka, you shrink!
Computational Geometry: Algorithms and Applications
Computational Geometry: Algorithms and Applications
Scheduling: Theory, Algorithms, and Systems
Scheduling: Theory, Algorithms, and Systems
Scheduling Algorithms
Exact Exponential Algorithms
Scheduling partially ordered jobs faster than 2n
ESA'11 Proceedings of the 19th European conference on Algorithms
| Hi-index | 5.23 |
In this paper, we focus on the Sort & Search method initially proposed by Horowitz and Sahni (1974) [6] to solve the knapsack problem, which has already show its applicability to derive exponential-time algorithms for some scheduling problems. We propose an extension of this method to a general class of problems called Multiple Constraint Problems and show that the extended Sort & Search method enables one to derive new exponential-time algorithms, with O^*(m^n^2) worst-case complexity, for two scheduling problems.