Login / Signup
A cutting plane method for risk-constrained traveling salesman problem with random arc costs.
Zhouchun Huang
Qipeng Phil Zheng
Eduardo Pasiliao
Vladimir Boginski
Tao Zhang
Published in:
J. Glob. Optim. (2019)
Keyphrases
</>
traveling salesman problem
cutting plane method
satisfy the triangle inequality
combinatorial optimization
ant colony optimization
traveling salesman
optimization problems
vehicle routing problem
cutting plane
valid inequalities
neural network
lower bound