On exact solutions for the Minmax Regret Spanning Tree problem.
Francisco Pérez-GalarceEduardo Álvarez-MirandaAlfredo Candia-VéjarPaolo TothPublished in: Comput. Oper. Res. (2014)
Keyphrases
- minmax regret
- interval data
- optimization criterion
- single machine scheduling problem
- shortest path problem
- resource allocation problems
- data clustering
- combinatorial optimization problems
- temporal data
- cost function
- resource allocation
- search space
- evolutionary algorithm
- multi objective
- semi supervised
- exact algorithms