Personal tools
You are here: Home Publications Journal Papers A branch-and-cut algorithm for a bipartite graph construction problem in digital communication systems

A branch-and-cut algorithm for a bipartite graph construction problem in digital communication systems

Filed under:
B. Kabakulak, Z.C. Taşkın, and A. E. Pusane, accepted for publication in Networks
Document Actions
« November 2019 »
November
MoTuWeThFrSaSu
123
45678910
11121314151617
18192021222324
252627282930