Minimizing Maximum Unmet Demand by Transportations Between Adjacent Nodes Characterized by Supplies and Demands (Q6087776)
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 7766088
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Minimizing Maximum Unmet Demand by Transportations Between Adjacent Nodes Characterized by Supplies and Demands |
scientific article; zbMATH DE number 7766088 |
Statements
Minimizing Maximum Unmet Demand by Transportations Between Adjacent Nodes Characterized by Supplies and Demands (English)
0 references
16 November 2023
0 references
algorithm design
0 references
demand
0 references
linear programming
0 references
NP-complete
0 references
one-way transportation
0 references
pseudoforest
0 references
pseudotree
0 references
supply
0 references
transportation problem
0 references
tree
0 references
0 references
0 references
0.8054250478744507
0 references
0.7123960852622986
0 references
0.7073317170143127
0 references
0.7050466537475586
0 references
0.7045566439628601
0 references
