Login / Signup

On the approximability of minmax (regret) network optimization problems.

Adam KasperskiPawel Zielinski
Published in: Inf. Process. Lett. (2009)
Keyphrases
  • optimization problems
  • minmax regret
  • interval data
  • evolutionary algorithm
  • objective function
  • cost function
  • shortest path problem
  • optimization criterion
  • search algorithm
  • lower bound
  • particle swarm optimization