Pages that link to "Item:Q596264"
From MaRDI portal
The following pages link to The computational complexity of the relative robust shortest path problem with interval data (Q596264):
Displayed 8 items.
- Restricted robust uniform matroid maximization under interval uncertainty (Q879971) (← links)
- Minimax regret spanning arborescences under uncertain costs (Q881514) (← links)
- A new model for path planning with interval data (Q1000974) (← links)
- A minmax regret approach to the critical path method with task interval times (Q1011286) (← links)
- Computing and minimizing the relative regret in combinatorial optimization with interval data (Q1019293) (← links)
- A branch and bound algorithm for the robust shortest path problem with interval data. (Q1426725) (← links)
- A Benders decomposition approach for the robust spanning tree problem with interval data (Q2503220) (← links)
- The robust shortest path problem in series -- parallel multidigraphs with interval data (Q2583712) (← links)