On minimum congestion routing in rearrangeable multihop lightwave networks (Q1922634): Difference between revisions
From MaRDI portal
Set profile property. |
ReferenceBot (talk | contribs) Changed an Item |
||
| Property / cites work | |||
| Property / cites work: Computational experience with a difficult mixed-integer multicommodity flow problem / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: The flow deviation method: An approach to store‐and‐forward communication network design / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Tabu Search—Part I / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Tabu Search—Part II / rank | |||
Normal rank | |||
Revision as of 13:22, 24 May 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | On minimum congestion routing in rearrangeable multihop lightwave networks |
scientific article |
Statements
On minimum congestion routing in rearrangeable multihop lightwave networks (English)
0 references
1 September 1996
0 references
optical networks
0 references
congestion in logically rearrangeable multihop lightwave networks
0 references
tabu search-based heuristic
0 references
NP-hard combinatorial problem
0 references
0 references
