Capacitated Network Design using Bin-Packing

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. 
DOI: 10.1016/j.endm.2013.05.128

Topics

1 Figure or Table

Slides referencing similar topics