Pages that link to "Item:Q1754007"
From MaRDI portal
The following pages link to Solving the team orienteering arc routing problem with a column generation approach (Q1754007):
Displaying 14 items.
- A matheuristic for the team orienteering arc routing problem (Q319589) (← links)
- A branch-and-cut algorithm for the orienteering arc routing problem (Q342166) (← links)
- Iterated local search and column generation to solve arc-routing as a permutation set-covering problem (Q1752200) (← links)
- Coupling feasibility pump and large neighborhood search to solve the Steiner team orienteering problem (Q2027061) (← links)
- Scheduling heterogeneous delivery tasks on a mixed logistics platform (Q2076846) (← 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)
- An exact algorithm for team orienteering problems (Q2477614) (← links)
- The team orienteering problem: formulations and branch-cut and price (Q2917295) (← 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)
- 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)
- The hiking tourist problem (Q6558645) (← links)