Network design problem with cut constraints

No Thumbnail Available

Date

2018

Journal Title

Journal ISSN

Volume Title

Publisher

Springer International Publishing

Access Rights

info:eu-repo/semantics/closedAccess

Abstract

In this paper, we introduce a minimum cost network design problem with a given lower bound requirement for capacity of any cut. First, we consider the subproblem including the lower bound requirement only for each fundamental cut determined by deleting edges from some spanning tree. Then, it is shown that the simplex algorithm finds an optimal solution to standard LP-relaxation of the subproblem in the linear time of the number of edges. The simplex and minimum cut algorithms are used in a Branch-and-Cut type algorithm to pick up a solution to the minimum cost network design problem. © Springer International Publishing AG, part of Springer Nature 2018.

Description

Keywords

Journal or Series

Springer Optimization and Its Applications

WoS Q Value

Scopus Q Value

N/A

Volume

139

Issue

Citation