A network simplex method for the budget-constrained minimum cost flow problem (Q1751898): Difference between revisions
From MaRDI portal
Changed an Item |
Changed an Item |
||
| Property / describes a project that uses | |||
| Property / describes a project that uses: NETGEN / rank | |||
Normal rank | |||
Revision as of 05:37, 29 February 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
