On Weighted vs Unweighted Versions of Combinatorial Optimization Problems.
Pierluigi CrescenziRiccardo SilvestriLuca TrevisanPublished in: Inf. Comput. (2001)
Keyphrases
- combinatorial optimization problems
- combinatorial optimization
- knapsack problem
- metaheuristic
- optimization problems
- discrete optimization
- ant colony optimization
- shortest path problem
- job shop scheduling
- traveling salesman problem
- job shop scheduling problem
- continuous optimization problems
- edge weights
- exact algorithms
- scoring rules
- vehicle routing problem
- evolutionary algorithm
- min cost
- np hard
- neural network
- minmax regret
- bipartite graph
- shortest path
- simulated annealing
- cost function
- genetic algorithm