Pages that link to "Item:Q2496041"

The following pages link to A tabu search algorithm for the Min-Max \(k\)-Chinese postman problem (Q2496041):

Displaying 9 items.

• Kripke modelling and verification of temporal specifications of a multiple UAV system (Q434449) (← links)
• Stochastic level-value approximation for quadratic integer convex programming (Q940660) (← links)
• A metaheuristic for the min-max windy rural postman problem with K vehicles (Q993701) (← links)
• The min-max close-enough arc routing problem (Q2116901) (← links)
• The aircraft maintenance base location problem (Q2356276) (← links)
• Min-Max <i>K</i> -vehicles windy rural postman problem (Q3057121) (← links)
• Recent results on Arc Routing Problems: An annotated bibliography (Q3057167) (← links)
• New facets and an enhanced branch-and-cut for the min-max <i>K</i> -vehicles windy rural postman problem (Q3113511) (← links)
• Approximation algorithms for the min-max mixed rural postmen cover problem and its variants (Q6130323) (← links)