Pages that link to "Item:Q4347416"
From MaRDI portal
The following pages link to A time-based formulation and upper bounding scheme for the selective travelling salesperson problem (Q4347416):
Displaying 5 items.
- The selective travelling salesman problem (Q910347) (← links)
- Efficient solutions for special zero-one programming problems (Q995926) (← links)
- Upper and lower bounds for the sales force deployment problem with explicit contiguity constraints (Q2253998) (← links)
- Analysis of the selective traveling salesman problem with time-dependent profits (Q2701177) (← links)
- Algorithms for a stochastic selective travelling salesperson problem (Q4679789) (← links)