Login / Signup

Single-commodity flow-based formulations and accelerated benders algorithms for the high-multiplicity asymmetric traveling salesman problem and its extensions.

Maichel M. AguayoSubhash C. SarinHanif D. Sherali
Published in: J. Oper. Res. Soc. (2018)
Keyphrases
  • decomposition algorithm
  • single commodity
  • genetic algorithm
  • reinforcement learning
  • objective function
  • evolutionary algorithm
  • dynamic programming
  • optimization problems