Incremental network design with maximum flows (Q726224): Difference between revisions
From MaRDI portal
Created claim: Wikidata QID (P12): Q57955342, #quickstatements; #temporary_batch_1714860828983 |
ReferenceBot (talk | contribs) Changed an Item |
||
| Property / cites work | |||
| Property / cites work: Incremental network design with shortest paths / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Integrating restoration and scheduling decisions for disrupted interdependent infrastructure systems / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Restoring infrastructure systems: an integrated network design and scheduling (INDS) problem / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Integrated network design and scheduling problems with parallel identical machines: Complexity results and dispatching rules / rank | |||
Normal rank | |||
Latest revision as of 06:40, 12 July 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Incremental network design with maximum flows |
scientific article |
Statements
Incremental network design with maximum flows (English)
0 references
8 July 2016
0 references
network design
0 references
approximation algorithms
0 references
scheduling
0 references
0 references
0 references
