On the computational complexity of minimum-concave-cost flow in a two-dimensional grid (Q2828332)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 6643042
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | On the computational complexity of minimum-concave-cost flow in a two-dimensional grid |
scientific article; zbMATH DE number 6643042 |
Statements
25 October 2016
0 references
minimum-concave-cost flow
0 references
two-dimensional grid
0 references
lot sizing
0 references
serial supply chain
0 references
computational complexity
0 references
polynomial-time algorithm
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0 references
On the computational complexity of minimum-concave-cost flow in a two-dimensional grid (English)
0 references
0.879455029964447
0 references
0.8065254092216492
0 references
0.7966422438621521
0 references
0.7943471670150757
0 references
0.7926859855651855
0 references
