Login / Signup

A greedy heuristic and a lower bound on a nonlinear stochastic TSP with partially satisfied node demand coverage constraint.

Murat CalSenol Altan
Published in: Int. J. Math. Oper. Res. (2023)
Keyphrases