A Local Search Modeling for Constrained Optimum Paths Problems (Extended Abstract)
暂无分享,去创建一个
[1] Natashia Boland,et al. Improved preprocessing, labeling and scaling algorithms for the Weight‐Constrained Shortest Path Problem , 2003, Networks.
[2] R. K. Wood,et al. Lagrangian relaxation and enumeration for solving constrained shortest-path problems , 2008 .
[3] Pascal Van Hentenryck,et al. Constraint-based local search , 2018, Handbook of Heuristics.
[4] Pascal Van Hentenryck,et al. LS(graph & tree): a local search framework for constraint optimization on graphs and trees , 2009, SAC '09.
[5] Nicos Christofides,et al. An algorithm for the resource constrained shortest path problem , 1989, Networks.
[6] Christian Blum,et al. Finding Edge-disjoint Paths in Networks: An Ant Colony Optimization Algorithm , 2007, J. Math. Model. Algorithms.