Pages that link to "Item:Q852946"

The following pages link to Lower bounds and heuristics for the windy rural postman problem (Q852946):

Displaying 17 items.

• A metaheuristic for the min-max windy rural postman problem with K vehicles (Q993701) (← links)
• A hybrid heuristic procedure for the windy rural postman problem with zigzag time windows (Q1651548) (← links)
• The generalized arc routing problem (Q1688441) (← links)
• Formulations and exact algorithms for the distance-constrained generalized directed rural postman problem (Q1707079) (← links)
• New heuristic algorithms for the windy rural postman problem (Q2387296) (← 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 scatter search algorithm for time-dependent prize-collecting arc routing problems (Q2669496) (← links)
• Solving the close-enough arc routing problem (Q2811327) (← 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)
• An Open-Source Desktop Application for Generating Arc-Routing Benchmark Instances (Q5131730) (← links)
• A branch-and-price algorithm for the windy rural postman problem (Q5388154) (← links)
• Plowing with precedence in polynomial time (Q6092637) (← links)
• The single robot line coverage problem: Theory, algorithms, and experiments (Q6180033) (← links)
• A branch-and-cut algorithm for the windy profitable location rural postman problem (Q6644370) (← links)