Article ID: | iaor2009620 |
Country: | Netherlands |
Volume: | 39 |
Issue: | 1 |
Start Page Number: | 37 |
End Page Number: | 50 |
Publication Date: | Jan 2008 |
Journal: | Computational Optimization and Applications |
Authors: | Pardalos Panos M., Nahapetyan Artyom |
Keywords: | supply & supply chains |
We approximate the objective function of the fixed charge network flow problem (FCNF) by a piecewise linear one, and construct a concave piecewise linear network flow problem (CPLNF). A proper choice of parameters in the CPLNF problem guarantees the equivalence between those two problems. We propose a heuristic algorithm for solving the FCNF problem, which requires solving a sequence of CPLNF problems. The algorithm employs the dynamic cost updating procedure (DCUP) to find a solution to the CPLNF problems.