"Minimum cost noncrossing flow problem on layered networks."

I. Kuban Altinel et al. (2019)

> Home

Details and statistics

DOI: 10.1016/J.DAM.2018.09.016

access: closed

type: Journal Article

metadata version: 2020-02-20

- view
  - electronic edition via DOI
  - unpaywalled version
  authority control:
- export record
  dblp key:
  - journals/dam/AltinelAST19
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/dam/AltinelAST19
I. Kuban Altinel, Necati Aras, Zeynep Suvak, Z. Caner Taskin:
Minimum cost noncrossing flow problem on layered networks. Discret. Appl. Math. 261: 2-21 (2019)

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.