Share This Author
Duality theorems for marginal problems
- H. Kellerer
- 1 November 1984
SummaryGiven topological spaces X1, ..., Xn with product space X, probability measures μi on Xi together with a real function h on X define a marginal problem as well as a dual problem. Using an…
Introduction to NP-Completeness of Knapsack Problems
The reader may have noticed that for all the considered variants of the knapsack problem, no polynomial time algorithm have been presented which solves the problem to optimality. Indeed all the…
Approximation algorithms for knapsack problems with cardinality constraints
Parallel machine scheduling with job assignment restrictions
An algorithm is contributed that provides a 3/2 worst case bound and runs in time linear in the number of jobs for assignment restrictions determined by just one characteristic of the machines.
Semi on-line algorithms for the partition problem
Optimization of cardinality constrained portfolios with a hybrid local search algorithm
This paper suggests a hybrid local search algorithm which combines principles of Simulated Annealing and evolutionary strategies and which proved to highly efficiently approach this problem.
A New Fully Polynomial Time Approximation Scheme for the Knapsack Problem
A fully polynomial time approximation scheme (FPTAS) is presented for the classical 0-1 knapsack problem, which considerably improves the necessary space requirements and reduces the running time.
An efficient fully polynomial approximation scheme for the Subset-Sum Problem