Pages that link to "Item:Q5426612"

The following pages link to Approximate solutions for the maximum benefit chinese postman problem (Q5426612):

Displaying 17 items.

• A branch-and-cut algorithm for the profitable windy rural postman problem (Q321108) (← links)
• A branch-and-cut algorithm for the maximum benefit Chinese postman problem (Q378087) (← links)
• The \(k\)-centrum Chinese postman delivery problem and a related cost allocation game (Q477339) (← links)
• City streets parking enforcement inspection decisions: the Chinese postman's perspective (Q726240) (← links)
• Uncertain multi-objective Chinese postman problem (Q780142) (← links)
• The arc partitioning problem (Q806736) (← links)
• Approximate solutions for the capacitated arc routing problem (Q1121808) (← links)
• The maximum benefit Chinese postman problem and the maximum benefit traveling salesman problem (Q1261382) (← links)
• The directed profitable rural postman problem with incompatibility constraints (Q1753601) (← links)
• An approximation algorithm for solving the heterogeneous Chinese postman problem (Q2151360) (← links)
• Approximating the length of Chinese postman tours (Q2257098) (← links)
• Profitable mixed capacitated arc routing and related problems (Q2343077) (← links)
• The profitable close-enough arc routing problem (Q2669779) (← links)
• Recent results on Arc Routing Problems: An annotated bibliography (Q3057167) (← links)
• Hierarchical Chinese postman problem with fuzzy travel times (Q5084174) (← links)
• An improved heuristic algorithm for the maximum benefit Chinese postman problem (Q5092514) (← links)
• Coordinated road-network search route planning by a team of UAVs (Q5410832) (← links)