A General Framework for Designing Approximation Schemes for Combinatorial Optimization Problems with Many Objectives Combined into One.
Shashi MittalAndreas S. SchulzPublished in: APPROX-RANDOM (2008)
Keyphrases
- combinatorial optimization problems
- approximation schemes
- knapsack problem
- optimization problems
- combinatorial optimization
- metaheuristic
- ant colony optimization
- discrete optimization
- approximation algorithms
- traveling salesman problem
- continuous optimization problems
- job shop scheduling
- job shop scheduling problem
- vehicle routing problem
- shortest path problem
- multiple objectives
- bin packing
- dynamic programming
- optimal solution
- minmax regret
- numerical methods
- greedy algorithm
- linear programming
- np hard
- min cost
- image analysis
- data structure