Pages that link to "Item:Q331985"
From MaRDI portal
The following pages link to On the recoverable robust traveling salesman problem (Q331985):
Displaying 14 items.
- Robustness in nonsmooth nonconvex optimization problems (Q830202) (← links)
- On recoverable and two-stage robust selection problems with budgeted uncertainty (Q1681259) (← links)
- Exact lexicographic scheduling and approximate rescheduling (Q2029366) (← links)
- Optimally solving a versatile traveling salesman problem on tree networks with soft due dates and multiple congestion scenarios (Q2294628) (← links)
- Combining traveling salesman and traveling repairman problems: a multi-objective approach based on multiple scenarios (Q2329723) (← links)
- The recoverable robust spanning tree problem with interval costs is polynomially solvable (Q2361123) (← links)
- Recoverable robust spanning tree problem under interval uncertainty representations (Q2410105) (← links)
- Robust recoverable and two-stage selection problems (Q2410249) (← links)
- Robust recoverable 0-1 optimization problems under polyhedral uncertainty (Q2424772) (← links)
- On the complexity of min-max-min robustness with two alternatives and budgeted uncertainty (Q2664004) (← links)
- On constraint qualifications and optimality conditions for robust optimization problems through pseudo-differential (Q6204200) (← links)
- Graph coloring approaches for a production planning problem with makespan and setup penalties in a product-wheel context (Q6559404) (← links)
- Benchmarking problems for robust discrete optimization (Q6568403) (← links)
- Recoverable robust shortest path problem under interval budgeted uncertainty representations (Q6663971) (← links)
