Pages that link to "Item:Q321108"

The following pages link to A branch-and-cut algorithm for the profitable windy rural postman problem (Q321108):

Displaying 12 items.

• The generalized arc routing problem (Q1688441) (← links)
• Formulations and exact algorithms for the distance-constrained generalized directed rural postman problem (Q1707079) (← links)
• The hierarchical mixed rural postman problem: polyhedral analysis and a branch-and-cut algorithm (Q1752763) (← links)
• The directed profitable rural postman problem with incompatibility constraints (Q1753601) (← links)
• A study of rural logistics center location based on intuitionistic fuzzy TOPSIS (Q1992493) (← links)
• Integer programming formulation and polyhedral results for windy collaborative arc routing problem (Q2146988) (← links)
• On path ranking in time-dependent graphs (Q2669544) (← links)
• The profitable close-enough arc routing problem (Q2669779) (← links)
• Arc routing problems: A review of the past, present, and future (Q6087068) (← links)
• An updated annotated bibliography on arc routing problems (Q6496350) (← links)
• A comprehensive survey on the generalized traveling salesman problem (Q6556079) (← links)
• A branch-and-cut algorithm for the windy profitable location rural postman problem (Q6644370) (← links)