| Article ID | Journal | Published Year | Pages | File Type |
|---|---|---|---|---|
| 4651814 | Electronic Notes in Discrete Mathematics | 2013 | 8 Pages |
Abstract
In this paper, we consider the Capacitated Network Design (CND) problem. We investigate the relationship between CND and the Bin-Packing problem. This is exploited for identifying new classes of valid inequalities for the CND problem and developing a branch-and-cut algorithm to solve it efficiently.
Related Topics
Physical Sciences and Engineering
Mathematics
Discrete Mathematics and Combinatorics
