Login / Signup

The Robust (Minmax Regret) Quadratic Assignment Problem with Interval Flows.

Mohammad Javad FeizollahiIgor Averbakh
Published in: INFORMS J. Comput. (2014)
Keyphrases
  • quadratic assignment problem
  • interval data
  • minmax regret
  • lower bound
  • data clustering
  • shortest path problem
  • tabu search
  • neural network
  • combinatorial optimization
  • utility function
  • constraint satisfaction