A network simplex method for the budget-constrained minimum cost flow problem (Q1751898): Difference between revisions
From MaRDI portal
Set profile property. |
Changed an Item |
||
| (One intermediate revision by one other user not shown) | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2467789022 / rank | |||
Normal rank | |||
| Property / arXiv ID | |||
| Property / arXiv ID: 1607.02284 / rank | |||
Normal rank | |||
Latest revision as of 22:52, 18 April 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | A network simplex method for the budget-constrained minimum cost flow problem |
scientific article |
Statements
A network simplex method for the budget-constrained minimum cost flow problem (English)
0 references
25 May 2018
0 references
combinatorial optimization
0 references
algorithms
0 references
network flow
0 references
minimum cost flow
0 references
network simplex
0 references
