"A Branch and Bound Algorithm for Minimum Cost Network Flow Problem."

Jun Han, Graham McMahon, Stephen Sugden (2002)

> Home

Details and statistics

DOI: 10.1007/3-540-45675-9_28

access: closed

type: Conference or Workshop Paper

metadata version: 2018-08-31

- view
  - electronic edition via DOI
  - unpaywalled version
  authority control:
- export record
  dblp key:
  - conf/ideal/HanMS02
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/conf/ideal/HanMS02
Jun Han, Graham McMahon, Stephen Sugden:
A Branch and Bound Algorithm for Minimum Cost Network Flow Problem. IDEAL 2002: 167-172

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.