"Integer programming formulations for the k-edge-connected ..."

I. Diarrassouba et al. (2016)

> Home

Details and statistics

DOI: 10.1002/NET.21667

access: closed

type: Journal Article

metadata version: 2020-09-21

- view
  - electronic edition via DOI
  - unpaywalled version
  authority control:
- export record
  dblp key:
  - journals/networks/DiarrassoubaGMG16
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/networks/DiarrassoubaGMG16
I. Diarrassouba, Virginie Gabrel, Ali Ridha Mahjoub, Luis Eduardo Neves Gouveia, Pierre Pesneau:
Integer programming formulations for the k-edge-connected 3-hop-constrained network design problem. Networks 67(2): 148-169 (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.