"Finding K shortest looping paths in a traffic-light network."

Hsu-Hao Yang, Yen-Liang Chen (2005)

> Home

Details and statistics

DOI: 10.1016/J.COR.2003.08.004

access: closed

type: Journal Article

metadata version: 2020-02-18

- view
  - electronic edition via DOI
  - unpaywalled version
  authority control:
- export record
  dblp key:
  - journals/cor/YangC05
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/cor/YangC05
Hsu-Hao Yang, Yen-Liang Chen:
Finding K shortest looping paths in a traffic-light network. Comput. Oper. Res. 32: 571-581 (2005)

manage site settings

To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.