An Experimental Evaluation of the Algorithm Mean Upper Heuristic for Interval Data Min-Max Regret Combinatorial Optimization Problem.
Jose Ricardo GoncalvesIago A. CarvalhoThiago Ferreira NoronhaPublished in: BRACIS (2017)
Keyphrases
- combinatorial optimization
- min max
- experimental evaluation
- simulated annealing
- shortest path problem
- combinatorial optimization problems
- interval data
- dynamic programming
- optimal solution
- optimization problems
- max min
- combinatorial problems
- exact algorithms
- traveling salesman problem
- objective function
- metaheuristic
- single machine scheduling problem
- worst case
- cost function
- branch and bound algorithm
- lower bound
- heuristic methods
- hard combinatorial optimization problems
- neural network
- minmax regret
- approximation algorithms
- solution quality
- benchmark problems
- branch and bound
- ant colony optimization
- linear programming
- np hard
- k means
- genetic algorithm