"A Lagrangian Relaxation Based Heuristic for Solving the Length-Balanced ..."

Yanzhi Li, Andrew Lim, Hong Ma (2005)

> Home

Details and statistics

DOI: 10.1007/11589990_196

access: closed

type: Conference or Workshop Paper

metadata version: 2020-06-17

- view
  - electronic edition via DOI
  - unpaywalled version
  authority control:
- export record
  dblp key:
  - conf/ausai/LiLM05
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/conf/ausai/LiLM05
Yanzhi Li, Andrew Lim, Hong Ma:
A Lagrangian Relaxation Based Heuristic for Solving the Length-Balanced Two Arc-Disjoint Shortest Paths Problem. Australian Conference on Artificial Intelligence 2005: 1323-1326

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.