Pages that link to "Item:Q2410105"
From MaRDI portal
The following pages link to Recoverable robust spanning tree problem under interval uncertainty representations (Q2410105):
Displaying 12 items.
- Investigating the recoverable robust single machine scheduling problem under interval uncertainty (Q833004) (← links)
- On the complexity of the robust spanning tree problem with interval data (Q1433657) (← links)
- On recoverable and two-stage robust selection problems with budgeted uncertainty (Q1681259) (← links)
- Confidence regional method of stochastic spanning tree problem (Q1905852) (← links)
- A linear time algorithm for the robust recoverable selection problem (Q1983118) (← links)
- Matroid bases with cardinality constraints on the intersection (Q2149563) (← links)
- Recoverable robust representatives selection problems with discrete budgeted uncertainty (Q2158008) (← links)
- The recoverable robust spanning tree problem with interval costs is polynomially solvable (Q2361123) (← links)
- Robust recoverable and two-stage selection problems (Q2410249) (← links)
- Robust recoverable 0-1 optimization problems under polyhedral uncertainty (Q2424772) (← links)
- Optimal matroid bases with intersection constraints: valuated matroids, M-convex functions, and their applications (Q5918723) (← links)
- Recoverable robust shortest path problem under interval budgeted uncertainty representations (Q6663971) (← links)
