Send-and-Split Method for Minimum-Concave-Cost Network Flows (Q3820348): Difference between revisions
From MaRDI portal
Created a new Item |
Normalize DOI. |
||
| (4 intermediate revisions by 4 users not shown) | |||
| Property / DOI | |||
| Property / DOI: 10.1287/moor.12.4.634 / rank | |||
| Property / MaRDI profile type | |||
| Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank | |||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1287/moor.12.4.634 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2150855695 / rank | |||
Normal rank | |||
| Property / DOI | |||
| Property / DOI: 10.1287/MOOR.12.4.634 / rank | |||
Normal rank | |||
| links / mardi / name | links / mardi / name | ||
Latest revision as of 22:09, 21 December 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Send-and-Split Method for Minimum-Concave-Cost Network Flows |
scientific article |
Statements
Send-and-Split Method for Minimum-Concave-Cost Network Flows (English)
0 references
1987
0 references
minimum-additive-concave-cost nonnegative network flows
0 references
send-and-split method
0 references
capacitated networks
0 references
dynamic economic-order-quantity problem
0 references
