On the complexity of the robust spanning tree problem with interval data (Q1433657): 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: On trees of a graph and their generation / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Robust discrete optimization and its applications / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q4851642 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q3914902 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q4004084 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: The robust spanning tree problem with interval data / rank | |||
Normal rank | |||
links / mardi / name | links / mardi / name | ||
Latest revision as of 17:14, 6 June 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | On the complexity of the robust spanning tree problem with interval data |
scientific article |
Statements
On the complexity of the robust spanning tree problem with interval data (English)
0 references
1 July 2004
0 references
Robust spanning tree
0 references
Robust optimization
0 references
Uncertainty
0 references
Interval data
0 references