A branch and bound algorithm for the robust spanning tree problem with interval data (Q706974): Difference between revisions
From MaRDI portal
Set OpenAlex properties. |
ReferenceBot (talk | contribs) Changed an Item |
||
| Property / cites work | |||
| Property / cites work: On the complexity of the robust spanning tree problem with interval data / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Two Algorithms for Generating Weighted Spanning Trees in Order / 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: On the shortest spanning subtree of a graph and the traveling salesman problem / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: A branch and bound algorithm for the robust shortest path problem with interval data. / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: The robust spanning tree problem with interval data / rank | |||
Normal rank | |||
Latest revision as of 17:58, 7 June 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | A branch and bound algorithm for the robust spanning tree problem with interval data |
scientific article |
Statements
A branch and bound algorithm for the robust spanning tree problem with interval data (English)
0 references
9 February 2005
0 references
Branch and bound
0 references
Robust optimization
0 references
Interval data
0 references
Spanning tree problem
0 references
