Pages that link to "Item:Q319589"
From MaRDI portal
The following pages link to A matheuristic for the team orienteering arc routing problem (Q319589):
Displaying 15 items.
- A branch-and-cut algorithm for the profitable windy rural postman problem (Q321108) (← links)
- Orienteering problem: a survey of recent variants, solution approaches and applications (Q323527) (← links)
- A branch-and-cut algorithm for the orienteering arc routing problem (Q342166) (← links)
- Approximation algorithms for the arc orienteering problem (Q477675) (← links)
- Efficient metaheuristics for the mixed team orienteering problem with time windows (Q1736755) (← 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)
- Design of diversified package tours for the digital travel industry: a branch-cut-and-price approach (Q2184040) (← links)
- Profitable mixed capacitated arc routing and related problems (Q2343077) (← links)
- A survey on matheuristics for routing problems (Q2513752) (← links)
- A hybrid adaptive large neighborhood search heuristic for the team orienteering problem (Q2664363) (← links)
- Arc routing problems: A review of the past, present, and future (Q6087068) (← links)
- A new mathematical model and a heuristic algorithm for the tourist trip design problem under new constraints: a real-world application (Q6191670) (← links)
- An updated annotated bibliography on arc routing problems (Q6496350) (← links)
