Pages that link to "Item:Q867540"
From MaRDI portal
The following pages link to Solving the asymmetric traveling purchaser problem (Q867540):
Displaying 12 items.
- The traveling purchaser problem, with multiple stacks and deliveries: a branch-and-cut approach (Q336445) (← links)
- Models for a traveling purchaser problem with additional side-constraints (Q709202) (← links)
- Solving the asymmetric traveling purchaser problem (Q867540) (← links)
- The bi-objective traveling purchaser problem with deliveries (Q1622816) (← links)
- The traveling purchaser problem with time-dependent quantities (Q1652259) (← links)
- The traveling purchaser problem and its variants (Q1751767) (← links)
- An experimental analysis of evolutionary heuristics for the biobjective traveling purchaser problem (Q1761771) (← links)
- Solving school bus routing using the multiple vehicle traveling purchaser problem: a branch-and-cut approach (Q1761989) (← links)
- Parameterized algorithms and complexity for the traveling purchaser problem and its variants (Q2084609) (← links)
- The distance constrained multiple vehicle traveling purchaser problem (Q2256245) (← links)
- The traveling purchaser problem with fast service option (Q2669765) (← links)
- A GRASP/Path‐Relinking algorithm for the traveling purchaser problem (Q6056165) (← links)