Pages that link to "Item:Q319918"
From MaRDI portal
The following pages link to A minimum cost network flow model for the maximum covering and patrol routing problem (Q319918):
Displaying 7 items.
- An improved formulation for the maximum coverage patrol routing problem (Q337517) (← links)
- Attractive orienteering problem with proximity and timing interactions (Q1754098) (← links)
- Time dependent orienteering problem with time windows and service time dependent profits (Q2147060) (← links)
- Optimizing insertions in a constraint routing problem with complicated cost functions (Q2290475) (← links)
- On routing and scheduling a fleet of resource-constrained vessels to provide ongoing continuous patrol coverage (Q2673804) (← links)
- MAXIMUM FLOW-COVERING LOCATION AND SERVICE START TIME PROBLEM AND ITS APPLICATION TO TOKYO METROPOLITAN RAILWAY NETWORK(<Special Issue>SCOPE (Seminar on Computation and OPtimization for new Extensions)) (Q3144761) (← links)
- On the computational complexity of the patrol boat scheduling problem with complete coverage (Q6093558) (← links)
