New tailored reward functions for greedy packing heuristics in the packing-while-travelling problem outperform standard approaches in both deterministic and chance-constrained stochastic settings.
On the shortest spanning subtree of a graph and the traveling salesman problem.Proceedings of the American Mathematical society, 7(1):48–50
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
cs.NE 1years
2026 1verdicts
UNVERDICTED 1representative citing papers
citing papers explorer
-
Greedy Approaches for Packing While Travelling with Deterministic and Stochastic Constraints
New tailored reward functions for greedy packing heuristics in the packing-while-travelling problem outperform standard approaches in both deterministic and chance-constrained stochastic settings.