Economic spare capacity planning for DCS mesh-restorable networks (Q1303707): Difference between revisions
From MaRDI portal
Created a new Item |
ReferenceBot (talk | contribs) Changed an Item |
||
| (2 intermediate revisions by 2 users not shown) | |||
| Property / MaRDI profile type | |||
| Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: A polyhedral approach to multicommodity survivable network design / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Modeling and Solving the Two-Facility Capacitated Network Loading Problem / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: A Branch-and-Cut Algorithm for the Resolution of Large-Scale Symmetric Traveling Salesman Problems / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Maximizing Submodular Set Functions: Formulations and Analysis of Algorithms / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Q3056948 / rank | |||
Normal rank | |||
| links / mardi / name | links / mardi / name | ||
Latest revision as of 22:38, 28 May 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Economic spare capacity planning for DCS mesh-restorable networks |
scientific article |
Statements
Economic spare capacity planning for DCS mesh-restorable networks (English)
0 references
25 May 2000
0 references
integer programming
0 references
spare channel assignment problem
0 references
synchronous transmission networks
0 references
digital cross-connect system
0 references
branch-and-cut algorithm
0 references
0 references
