Pages that link to "Item:Q2361123"

The following pages link to The recoverable robust spanning tree problem with interval costs is polynomially solvable (Q2361123):

Displaying 9 items.

• Robust combinatorial optimization under convex and discrete cost uncertainty (Q668950) (← links)
• Investigating the recoverable robust single machine scheduling problem under interval uncertainty (Q833004) (← links)
• On recoverable and two-stage robust selection problems with budgeted uncertainty (Q1681259) (← 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)
• Recoverable robust spanning tree problem under interval uncertainty representations (Q2410105) (← 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)