Pages that link to "Item:Q342578"
From MaRDI portal
The following pages link to Time constrained maximal covering salesman problem with weighted demands and partial coverage (Q342578):
Displaying 10 items.
- Metaheuristics for the distance constrained generalized covering traveling salesman problem (Q832809) (← links)
- The time constrained maximal covering salesman problem (Q1631991) (← links)
- Gotta (efficiently) catch them all: Pokémon GO meets orienteering problems (Q1681305) (← links)
- A covering traveling salesman problem with profit in the last mile delivery (Q2070135) (← links)
- Spatial coverage in routing and path planning problems (Q2083923) (← links)
- Exact algorithms for budgeted prize-collecting covering subgraph problems (Q2147080) (← links)
- A data-driven optimization framework for routing mobile medical facilities (Q2196113) (← links)
- Robust strategic planning for mobile medical units with steerable and unsteerable demands (Q2239842) (← links)
- Mixed-integer programming approaches for the time-constrained maximal covering routing problem (Q2241905) (← links)
- A branch-and-cut algorithm for the maximum covering cycle problem (Q2288980) (← links)