Pages that link to "Item:Q1892106"
From MaRDI portal
The following pages link to Solvable cases of the \(k\)-person Chinese postman problem (Q1892106):
Displaying 13 items.
- Parameterized complexity of \(k\)-Chinese postman problem (Q391983) (← links)
- Uncertain multi-objective Chinese postman problem (Q780142) (← links)
- A metaheuristic for the min-max windy rural postman problem with K vehicles (Q993701) (← links)
- Algorithms for the windy postman problem (Q1332802) (← links)
- Approximation algorithms for some min-max postmen cover problems (Q2241210) (← links)
- Improved approximation algorithms for some min-max postmen cover problems with applications to the min-max subtree cover (Q2699031) (← links)
- A branch-price-and-cut algorithm for the min-max<i>k</i>-vehicle windy rural postman problem (Q2811322) (← links)
- Min-Max <i>K</i> -vehicles windy rural postman problem (Q3057121) (← links)
- New facets and an enhanced branch-and-cut for the min-max <i>K</i> -vehicles windy rural postman problem (Q3113511) (← links)
- Well-solved cases of the 2-peripatetic salesman problem (Q4351794) (← links)
- Approximate solutions for the maximum benefit chinese postman problem (Q5426612) (← links)
- A novel model for sustainable waste collection arc routing problem: Pareto-based algorithms (Q6115587) (← links)
- Approximation algorithms for the restricted \(k\)-Chinese postman problems with penalties (Q6181377) (← links)
