Complexity of strict robust integer minimum cost flow problems: An overview and further results.

André B. Chassein Anika Kinscherff

Published in: Comput. Oper. Res. (2019)

Keyphrases

minimum cost flow
shortest path
network simplex algorithm
bi objective
strongly polynomial
shortest path algorithm
worst case
efficient solutions
multi objective
cost function
optimization problems
minimum cost
search space
combinatorial optimization
benchmark problems
shortest path problem