Pages that link to "Item:Q1319678"
From MaRDI portal
The following pages link to On the mixed Chinese postman problem (Q1319678):
Displaying 9 items.
- Approximation algorithms for solving the constrained arc routing problem in mixed graphs (Q297063) (← links)
- The multi-dimension RSA and its low exponent security (Q1589779) (← links)
- Separating capacity constraints in the CVRP using tabu search (Q1609917) (← links)
- Routing problems: A bibliography (Q1908308) (← links)
- Asymptotic surrogate constraint method and its convergence for a class of semi-infinite programming (Q1970753) (← links)
- New results on the windy postman problem (Q2429464) (← links)
- Zigzag inequalities: a new class of facet-inducing inequalities for arc routing problems (Q2494509) (← links)
- A comparison of two different formulations for arc routing problems on mixed graphs (Q2496040) (← links)
- Approximation Algorithms for a Mixed Postman Problem with Restrictions on the Arcs (Q2958236) (← links)
