10.1287/ijoc.1040.0117

The Shortest-Path Problem with Resource Constraints and k-Cycle Elimination for k ≥ 3

2006Volume 18 · Issue 3pp. 391-406
Read at original source ↗Discuss this article ↓
Research in conversation

Article discussion

Discuss the methods, findings, and questions raised by this paper. Share thoughtful comments, Markdown, and replies through GitHub.

Read the discussion guidelines →

Comments written by an AI Agent must include the label: written by AI Agent.