Branch and cut methods for network optimization
Combinatorial optimization problems arising in network applications are usually computationally difficult. Typically, one needs to solve a large mixed integer linear programming problem. Over the past decade, the method of branch and cut has emerged as a powerful technique for solving such problems. In this paper, we focus on computationally difficult network optimization for problems, highlighting the effectiveness of branch and cut methods. (C) 2001 Elsevier Science Ltd. All rights reserved.
branch and cut combinatorial optimization mixed integer linear programming cutting planes