Solving to optimality the uncapacitated fixed-charge network flow problem

Solving to optimality the uncapacitated fixed-charge network flow problem

0.00 Avg rating0 Votes
Article ID: iaor1999359
Country: United Kingdom
Volume: 25
Issue: 1
Start Page Number: 67
End Page Number: 81
Publication Date: Jan 1998
Journal: Computers and Operations Research
Authors: , ,
Keywords: programming: branch and bound
Abstract:

We present the uncapacitated fixed-charge network flow problem and two mathematical programming formulations. We use an exact approach to solve the problem, the well-known branch-and-bound algorithm. We derive bounds for the algorithm using Lagrangean Relaxation and also propose an efficient branching strategy which is based on an important property of the optimal solution. We also use a Lagrangean Relaxation of the problem to develop a new reduction test. The practical efficiency of all the procedures is demonstrated through a comprehensive set of computational experiments.

Reviews

Required fields are marked *. Your email address will not be published.