A network simplex method for the budget-constrained minimum cost flow problem (Q1751898): Difference between revisions
From MaRDI portal
Created a new Item |
Changed an Item |
||
(5 intermediate revisions by 4 users not shown) | |||
Property / describes a project that uses | |||
Property / describes a project that uses: Gurobi / rank | |||
Normal rank | |||
Property / describes a project that uses | |||
Property / describes a project that uses: NETGEN / rank | |||
Normal rank | |||
Property / MaRDI profile type | |||
Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank | |||
Property / OpenAlex ID | |||
Property / OpenAlex ID: W2467789022 / rank | |||
Normal rank | |||
Property / arXiv ID | |||
Property / arXiv ID: 1607.02284 / rank | |||
Normal rank | |||
links / mardi / name | links / mardi / name | ||
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