A branch and bound algorithm for the robust spanning tree problem with interval data (Q706974): Difference between revisions
From MaRDI portal
Set profile property. |
Set OpenAlex properties. |
||
Property / full work available at URL | |||
Property / full work available at URL: https://doi.org/10.1016/j.ejor.2003.10.008 / rank | |||
Normal rank | |||
Property / OpenAlex ID | |||
Property / OpenAlex ID: W1971456873 / rank | |||
Normal rank |
Revision as of 00:22, 20 March 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