scholarly journals A polynomial local optimality condition for the concave piecewise linear network flow problem

2021 ◽  
Vol 6 (3) ◽  
pp. 2094-2113
Author(s):  
Zhibin Nie ◽  
◽  
Shuning Wang ◽  
Xiaolin Huang ◽  
2017 ◽  
Vol 34 (06) ◽  
pp. 1750033 ◽  
Author(s):  
Naoto Katayama

Multicommodity network problems appear in numerous applications, such as telecommunications, logistics, transportation, distribution and production planning networks. The piecewise linear multicommodity network flow problem is a multicommodity network flow problem with piecewise linear costs corresponding to multiple resources, such as communication lines, vehicles and production lines. In the present paper, for the piecewise linear multicommodity network continuous flow problem, we present a path-based formulation and an arc-based formulation, and develop a combined matheuristic approach, which combines capacity scaling, a column and row generation technique, restricted branch-and-bound and a local branch method.


2018 ◽  
Vol 64 ◽  
pp. 105-114 ◽  
Author(s):  
Jean-François Baffier ◽  
Pierre-Louis Poirion ◽  
Vorapong Suppakitpaisarn

Sign in / Sign up

Export Citation Format

Share Document