Pages that link to "Item:Q2569122"
From MaRDI portal
The following pages link to An addendum on: ``Sensitivity analysis of the optimal assignment'' (Q2569122):
Displaying 11 items.
- Efficient computation of tolerances in the weighted independent set problem for trees (Q378171) (← links)
- Efficient computation of tolerances in the weighted independent set problem for some classes of graphs (Q461929) (← links)
- A labeling algorithm for the sensitivity ranges of the assignment problem (Q651673) (← links)
- Extending single tolerances to set tolerances (Q1671336) (← links)
- Lower tolerance-based branch and bound algorithms for the ATSP (Q1761975) (← links)
- Efficient computation of tolerances in the sensitivity analysis of combinatorial bottleneck problems (Q2089667) (← links)
- A tolerance-based heuristic approach for the weighted independent set problem (Q2253961) (← links)
- The reduction of computation times of upper and lower tolerances for selected combinatorial optimization problems (Q2399487) (← links)
- Sensitivity analysis for bottleneck assignment problems (Q2673565) (← links)
- Tolerance-Based vs. Cost-Based Branching for the Asymmetric Capacitated Vehicle Routing Problem (Q2820103) (← links)
- A BRANCH-AND-BOUND ALGORITHM FOR FINDING ALL OPTIMAL SOLUTIONS OF THE ASSIGNMENT PROBLEM (Q3502867) (← links)
