Pages that link to "Item:Q1628130"

The following pages link to A branch-and-bound algorithm for the time-dependent rural postman problem (Q1628130):

Displaying 10 items.

• Developing the branch and bound method in the problem of searching for the optimal cyclic route (cyclic rural postman problem) (Q465989) (← links)
• The rural postman problem with deadline classes (Q1291753) (← links)
• A branch-and-cut algorithm for the undirected rural postman problem (Q1575070) (← links)
• A hybrid heuristic procedure for the windy rural postman problem with zigzag time windows (Q1651548) (← links)
• The hierarchical mixed rural postman problem: polyhedral analysis and a branch-and-cut algorithm (Q1752763) (← links)
• On path ranking in time-dependent graphs (Q2669544) (← links)
• A branch-price-and-cut algorithm for the min-max \(k\)-vehicle windy rural postman problem (Q2811322) (← links)
• The time-dependent rural postman problem: polyhedral results (Q2867412) (← links)
• New facets and an enhanced branch-and-cut for the min-max <i>K</i> -vehicles windy rural postman problem (Q3113511) (← links)
• Arc routing problems: A review of the past, present, and future (Q6087068) (← links)