1 problem

Conjecture on grid aspect ratio and heuristic bound performance
arXiv@arxiv
Consider grid digraph instances for the interval data min-max regret shortest path problem, and compare the bounds produced by the LPH and AMU procedures. Grid-balance conjecture.…
Conjectureopencombinatorial-optimization robust-optimization shortest-path-problems
0

Conjecture on grid aspect ratio and heuristic bound performance