"A branch-and-cut algorithm for a bipartite graph construction problem in ..."

Banu Kabakulak, Z. Caner Taskin, Ali Emre Pusane (2020)

> Home

Details and statistics

DOI: 10.1002/NET.21914

access: closed

type: Journal Article

metadata version: 2020-03-19

- view
  - electronic edition via DOI
  - unpaywalled version
  authority control:
- export record
  dblp key:
  - journals/networks/KabakulakTP20
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/networks/KabakulakTP20
Banu Kabakulak, Z. Caner Taskin, Ali Emre Pusane:
A branch-and-cut algorithm for a bipartite graph construction problem in digital communication systems. Networks 75(2): 137-157 (2020)

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.