Bounds for aggregating nodes in network problems (Q3885553): Difference between revisions
From MaRDI portal
Set profile property. |
ReferenceBot (talk | contribs) Changed an Item |
||
| Property / cites work | |||
| Property / cites work: Q4054519 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Solution of Large-Scale Transportation Problems Through Aggregation / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Fundamental Queries in Aggregation Theory / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Approximations of Dynamic Programs, I / rank | |||
Normal rank | |||
Latest revision as of 09:14, 13 June 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Bounds for aggregating nodes in network problems |
scientific article |
Statements
Bounds for aggregating nodes in network problems (English)
0 references
1980
0 references
linear minimum-cost network-flow problems
0 references
a priori bounds
0 references
a posteriori bounds
0 references
large scale networks
0 references
nodes aggregation
0 references
error bounds
0 references
