Pages that link to "Item:Q342166"

The following pages link to A branch-and-cut algorithm for the orienteering arc routing problem (Q342166):

Displaying 16 items.

• Orienteering problem: a survey of recent variants, solution approaches and applications (Q323527) (← links)
• An efficient evolutionary algorithm for the orienteering problem (Q1652505) (← links)
• The periodic rural postman problem with irregular services on mixed graphs (Q1734335) (← links)
• Solving the team orienteering arc routing problem with a column generation approach (Q1754007) (← links)
• Coupling feasibility pump and large neighborhood search to solve the Steiner team orienteering problem (Q2027061) (← links)
• Robust drone selective routing in humanitarian transportation network assessment (Q2083969) (← links)
• Integer programming formulation and polyhedral results for windy collaborative arc routing problem (Q2146988) (← links)
• Boosting ant colony optimization via solution prediction and machine learning (Q2147035) (← links)
• A hybrid adaptive large neighborhood search heuristic for the team orienteering problem (Q2664363) (← links)
• On path-bridge inequalities for the orienteering arc routing problems (Q5151530) (← links)
• Constraint relaxation for the discrete ordered median problem (Q6081610) (← links)
• Arc routing problems: A review of the past, present, and future (Q6087068) (← links)
• A revisited branch-and-cut algorithm for large-scale orienteering problems (Q6087525) (← links)
• An updated annotated bibliography on arc routing problems (Q6496350) (← links)
• The hiking tourist problem (Q6558645) (← links)
• A branch-and-cut algorithm for the windy profitable location rural postman problem (Q6644370) (← links)