Pseudopolynomial iterative algorithm to solve total-payoff games and min-cost reachability games.
Thomas BrihayeGilles GeeraertsAxel HaddadBenjamin MonmegePublished in: Acta Informatica (2017)
Keyphrases
- min cost
- dynamic programming
- optimal solution
- computational complexity
- max flow
- worst case
- segmentation algorithm
- game theory
- simulated annealing
- cost function
- search space
- linear programming
- ant colony optimization
- resource allocation
- combinatorial optimization problems
- globally optimal
- network flow
- search algorithm