On the computational complexity of minimum-concave-cost flow in a two-dimensional grid
From MaRDI portal
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.
Recommendations
- Minimum concave cost flow over a grid network
- Minimum concave-cost network flow problems: Applications, complexity, and algorithms
- Strongly polynomial algorithm for two special minimum concave cost network flow problems
- The minimum concave cost network flow problem with fixed numbers of sources and nonlinear arc costs
- A minimum concave-cost dynamic network flow problem with an application to lot-sizing
Cites work
- A Backlogging Model and a Multi-Echelon Model of a Dynamic Economic Lot Size Production System—A Network Approach
- A dynamic programming approach for solving single-source uncapacitated concave minimum cost network flow problems
- A Facilities in Series Inventory Model with Nested Schedules
- A polyhedral study of multiechelon lot sizing with intermediate demands
- A polynomial time solvable concave network flow problem
- A Simple Forward Algorithm to Solve General Dynamic Lot Sizing Models with n Periods in 0(n log n) or 0(n) Time
- A strongly polynomial algorithm for a concave production-transportation problem with a fixed number of nonlinear variables
- An O(T3) Algorithm for the Economic Lot-Sizing Problem with Constant Capacities
- An O(n^2) algorithm for lot sizing with inventory bounds and fixed costs
- Basis paths and a polynomial algorithm for the multistage production-capacitated lot-sizing problem
- Computational Complexity of the Capacitated Lot Size Problem
- Convex Analysis
- Deterministic Production Planning with Concave Costs and Capacity Constraints
- Deterministic Production Planning: Algorithms and Complexity
- Dynamic version of the economic lot size model
- Economic Lot Sizing: An O(n log n) Algorithm That Runs in Linear Time in the Wagner-Whitin Case
- Four equivalent lot-sizing models
- scientific article; zbMATH DE number 3639144 (Why is no real title available?)
- scientific article; zbMATH DE number 1321699 (Why is no real title available?)
- Improved Algorithms for Economic Lot Size Problems
- Integrated lot sizing in serial supply chains with production capacities
- Introduction to algorithms.
- Linear-programming extended formulations for the single-item lot-sizing problem with backlogging and constant capacity
- Lot Sizing with Inventory Bounds and Fixed Costs: Polyhedral Study and Computation
- Lot-size models with backlogging: Strong reformulations and cutting planes
- Minimum concave cost flow over a grid network
- Minimum concave-cost network flow problems: Applications, complexity, and algorithms
- Network flows. Theory, algorithms, and applications.
- On a theory of computation and complexity over the real numbers: 𝑁𝑃- completeness, recursive functions and universal machines
- Production Planning by Mixed Integer Programming
- Send-and-Split Method for Minimum-Concave-Cost Network Flows
- Solving Multi-Item Lot-Sizing Problems Using Strong Cutting Planes
- The minimum concave cost network flow problem with fixed numbers of sources and nonlinear arc costs
Cited in
(3)
This page was built for publication: On the computational complexity of minimum-concave-cost flow in a two-dimensional grid
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2828332)
