Minimum concave-cost network flow problems applications, complexity, and algorithms

Minimum concave-cost network flow problems applications, complexity, and algorithms

0.00 Avg rating0 Votes
Article ID: iaor19911361
Country: Switzerland
Volume: 25
Start Page Number: 189
End Page Number: 195
Publication Date: May 1990
Journal: Annals of Operations Research
Authors: ,
Abstract:

The authors discuss a wide range of results for minimum concave-cost network flow problems, including related applications, complexity issues, and solution techniques. Applications from production and inventory planning, and transportation and communication network design are discussed. New complexity results are proved which show that this problem is NP-hard for cases with cost functions other than fixed charge. An overview of solution techniques for this problem is presented, with some new results given regarding the implementation of a particular branch-and-bound approach.

Reviews

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