Pages that link to "Item:Q2241905"
From MaRDI portal
The following pages link to Mixed-integer programming approaches for the time-constrained maximal covering routing problem (Q2241905):
Displaying 4 items.
- An improved formulation for the maximum coverage patrol routing problem (Q337517) (← links)
- Time constrained maximal covering salesman problem with weighted demands and partial coverage (Q342578) (← links)
- The time constrained maximal covering salesman problem (Q1631991) (← links)
- Mixed integer programming-based liveness test for FMS with full routing flexibility (Q2336334) (← links)