Pages that link to "Item:Q761971"
From MaRDI portal
The following pages link to On dual solutions of the linear assignment problem (Q761971):
Displaying 11 items.
- A reduction approach to the repeated assignment problem (Q531433) (← links)
- A labeling algorithm for the sensitivity ranges of the assignment problem (Q651673) (← links)
- A note on dual solutions of the assignment problem in connection with the traveling salesman problem (Q911984) (← links)
- Triangle inequality and symmetry in connection with the assignment and the traveling salesman problem (Q1119486) (← links)
- An additive bounding procedure for the asymmetric travelling salesman problem (Q1184344) (← links)
- Solving some lexicographic multi-objective combinatorial problems (Q1598728) (← links)
- Efficient computation of tolerances in the sensitivity analysis of combinatorial bottleneck problems (Q2089667) (← links)
- The reduction of computation times of upper and lower tolerances for selected combinatorial optimization problems (Q2399487) (← links)
- An addendum on: ``Sensitivity analysis of the optimal assignment'' (Q2569122) (← links)
- Improving Christofides' lower bound for the traveling salesman problem (Q3698662) (← links)
- Better assignment lower bounds for the Euclidean traveling salesman problem (Q3771999) (← links)
