Strongly polynomial bounds for multiobjective and parametric global minimum cuts in graphs and hypergraphs.
Hassene AissiAli Ridha MahjoubS. Thomas McCormickMaurice QueyrannePublished in: Math. Program. (2015)
Keyphrases
- global minimum
- multi objective
- strongly polynomial
- cost function
- minimum cost flow
- bi objective
- simulated annealing
- evolutionary algorithm
- energy function
- energy minimization
- linear programming
- objective function
- multi objective optimization
- lower bound
- global minimization
- global optimum
- genetic algorithm
- linear program
- optimization algorithm
- upper bound
- particle swarm optimization
- nsga ii
- multiple objectives
- global minima
- optimization problems
- tabu search
- multiscale
- computer vision