Pages that link to "Item:Q3802908"

The following pages link to New lower bounds for the Capacitated Arc Routing Problem (Q3802908):

Displaying 18 items.

• Improved bounds for large scale capacitated arc routing problem (Q336459) (← links)
• GRASP with evolutionary path-relinking for the capacitated arc routing problem (Q336740) (← links)
• A lower bound for the node, edge, and arc routing problem (Q340291) (← links)
• New upper bounds for the multi-depot capacitated arc routing problem (Q537994) (← links)
• The open capacitated arc routing problem (Q716347) (← links)
• The capacitated arc routing problem: Valid inequalities and facets (Q1384095) (← links)
• Solving large-scale time capacitated arc routing problems: from real-time heuristics to metaheuristics (Q1730649) (← links)
• A cutting plane algorithm for the capacitated arc routing problem (Q1870825) (← links)
• Improved lower bounds and exact algorithm for the capacitated arc routing problem (Q1942278) (← links)
• Lower-bounding and heuristic methods for a refuse collection vehicle routing problem (Q1969871) (← links)
• Robust drone selective routing in humanitarian transportation network assessment (Q2083969) (← links)
• Lower and upper bounds for the mixed capacitated arc routing problem (Q2496039) (← links)
• New lower bound for the capacitated arc routing problem (Q2496046) (← links)
• Solving capacitated arc routing problems using a transformation to the CVRP (Q2581620) (← links)
• NODE DUPLICATION LOWER BOUNDS FOR THE CAPACITATED ARC ROUTING PROBLEM (Q4015406) (← links)
• The Capacitated Arc Routing Problem: Lower bounds (Q4022732) (← links)
• Approximate solutions for the maximum benefit chinese postman problem (Q5426612) (← links)
• On matchings, <i>T</i>‐joins, and arc routing in road networks (Q6065851) (← links)