Lagrangian relaxation and enumeration for solving constrained shortest-path problems

W. Matthew Carlyle, Johannes O. Royset, R. Kevin Wood. Lagrangian relaxation and enumeration for solving constrained shortest-path problems. Networks, 52(4):256-270, 2008. [doi]

References

No references recorded for this publication.

Cited by

No citations of this publication recorded.