Pages that link to "Item:Q378087"

The following pages link to A branch-and-cut algorithm for the maximum benefit Chinese postman problem (Q378087):

Displaying 15 items.

• A branch-and-cut algorithm for the profitable windy rural postman problem (Q321108) (← links)
• City streets parking enforcement inspection decisions: the Chinese postman's perspective (Q726240) (← links)
• The generalized arc routing problem (Q1688441) (← links)
• The periodic rural postman problem with irregular services on mixed graphs (Q1734335) (← links)
• The directed profitable rural postman problem with incompatibility constraints (Q1753601) (← links)
• Polyhedral analysis and a new algorithm for the length constrained \(K\)-drones rural postman problem (Q2162526) (← links)
• Multi-depot rural postman problems (Q2408522) (← links)
• The profitable close-enough arc routing problem (Q2669779) (← links)
• Hierarchical Chinese postman problem with fuzzy travel times (Q5084174) (← links)
• An improved heuristic algorithm for the maximum benefit Chinese postman problem (Q5092514) (← links)
• Upgrading edges in the graphical TSP (Q6047867) (← links)
• Arc routing problems: A review of the past, present, and future (Q6087068) (← links)
• The multi‐purpose <i>K</i>‐drones general routing problem (Q6180030) (← links)
• An updated annotated bibliography on arc routing problems (Q6496350) (← links)
• Theoretical and computational analysis of a new formulation for the rural postman problem and the general routing problem (Q6551080) (← links)