"On the Effectiveness of the Linear Programming Relaxation of the 0-1 ..."

Dae-Sik Choi, In-Chan Choi (2006)

> Home

Details and statistics

DOI: 10.1007/11809678_54

access: closed

type: Conference or Workshop Paper

metadata version: 2017-05-23

- view
  - electronic edition via DOI
  - unpaywalled version
  authority control:
- export record
  dblp key:
  - conf/cocoon/ChoiC06
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/conf/cocoon/ChoiC06
Dae-Sik Choi, In-Chan Choi:
On the Effectiveness of the Linear Programming Relaxation of the 0-1 Multi-commodity Minimum Cost Network Flow Problem. COCOON 2006: 517-526

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.