On Preemptive Resource Constrained Scheduling: Polynomial-Time Approximation Schemes
Proceedings of the 9th International IPCO Conference on Integer Programming and Combinatorial Optimization
An Asymptotic Fully Polynomial Time Approximation Scheme for Bin Covering
ISAAC '02 Proceedings of the 13th International Symposium on Algorithms and Computation
Combining Arithmetic and Geometric Rounding Techniques for Knapsack Problems
FCT '01 Proceedings of the 13th International Symposium on Fundamentals of Computation Theory
On rectangle packing: maximizing benefits
SODA '04 Proceedings of the fifteenth annual ACM-SIAM symposium on Discrete algorithms
An evolutionary lagrangian method for the 0/1 multiple knapsack problem
GECCO '05 Proceedings of the 7th annual conference on Genetic and evolutionary computation
Hybrid rounding techniques for knapsack problems
Discrete Applied Mathematics - Special issue: Efficient algorithms
Improved algorithms for two single machine scheduling problems
Theoretical Computer Science - Algorithmic applications in management
A new heuristic algorithm for the machine scheduling problem with job delivery coordination
Theoretical Computer Science
Hybrid rounding techniques for knapsack problems
Discrete Applied Mathematics - Special issue: Efficient algorithms
Algorithmic aspects of risk management
Formal modeling
Improved algorithms for two single machine scheduling problems
AAIM'05 Proceedings of the First international conference on Algorithmic Applications in Management
Planning in logistics: a survey
Proceedings of the 10th Performance Metrics for Intelligent Systems Workshop
Hi-index | 0.00 |