"Approximating the k-splittable capacitated network design problem."

Ehab Morsy (2016)

> Home

Details and statistics

DOI: 10.1016/J.DISOPT.2016.09.001

access: closed

type: Journal Article

metadata version: 2022-02-08

- view
  - electronic edition via DOI
  - unpaywalled version
  authority control:
- export record
  dblp key:
  - journals/disopt/Morsy16
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/disopt/Morsy16
Ehab Morsy:
Approximating the k-splittable capacitated network design problem. Discret. Optim. 22: 328-340 (2016)

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.