-

 

 

 




Optimization Online





 

On the computational complexity of minimum-concave-cost flow in a two-dimensional grid

Shabbir Ahmed(sahmed***at***isye.gatech.edu)
Qie He(qhe***at***umn.edu)
Shi Li(shil***at***buffalo.edu)
George Nemhauser(gnemhaus***at***isye.gatech.edu)

Abstract: We study the minimum-concave-cost flow problem on a two-dimensional grid. We characterize the computational complexity of this problem based on the number of rows and columns of the grid, the number of different capacities over all arcs, and the location of sources and sinks. The concave cost over each arc is assumed to be evaluated through an oracle machine, i.e., the oracle machine returns the cost over an arc in a single computational step, given the flow value and the arc index. We propose an algorithm whose running time is polynomial in the number of columns of the grid, for the following cases: (1) the grid has a constant number of rows, a constant number of different capacities over all arcs, and sources and sinks in at most two rows; (2) the grid has two rows and a constant number of different capacities over all arcs connecting rows; (3) the grid has a constant number of rows and all sources in one row, with infinite capacity over each arc. These are presumably the most general polynomially solvable cases, since we show the problem becomes NP-hard when any condition in these cases is removed. Our results apply to abundant variants and generalizations of the dynamic lot sizing model, and answer several questions raised in serial supply chain optimization.

Keywords: minimum-concave-cost flow, two-dimensional grid, lot sizing, computational complexity

Category 1: Combinatorial Optimization

Category 2: Network Optimization

Category 3: Applications -- OR and Management Sciences (Production and Logistics )

Citation:

Download: [PDF]

Entry Submitted: 10/27/2015
Entry Accepted: 10/28/2015
Entry Last Modified: 10/27/2015

Modify/Update this entry


  Visitors Authors More about us Links
  Subscribe, Unsubscribe
Digest Archive
Search, Browse the Repository

 

Submit
Update
Policies
Coordinator's Board
Classification Scheme
Credits
Give us feedback
Optimization Journals, Sites, Societies
Mathematical Optimization Society