Pages that link to "Item:Q1314323"
From MaRDI portal
The following pages link to An \(O(n)\) algorithm to solve the Bottleneck Traveling Salesman Problem restricted to ordered product matrices (Q1314323):
Displaying 9 items.
- Experimental analysis of heuristics for the bottleneck traveling salesman problem (Q519098) (← links)
- Efficiently solvable special cases of bottleneck travelling salesman problems (Q1179263) (← links)
- Extending single tolerances to set tolerances (Q1671336) (← links)
- Perspectives of Monge properties in optimization (Q1923588) (← links)
- Minimizing the number of workers in a paced mixed-model assembly line (Q1991120) (← links)
- Efficient computation of tolerances in the sensitivity analysis of combinatorial bottleneck problems (Q2089667) (← links)
- An Algorithm for the Bottleneck Traveling Salesman Problem (Q3328310) (← links)
- Well-solved cases of the 2-peripatetic salesman problem (Q4351794) (← links)
- Assessing the effect of multiple cost changes using reverse set tolerances (Q6558690) (← links)