The following pages link to Travelling purchaser problem (Q1156697):
Displaying 28 items.
- Optimal capacitated ring trees (Q286687) (← links)
- The traveling purchaser problem, with multiple stacks and deliveries: a branch-and-cut approach (Q336445) (← links)
- The traveling purchaser problem with stochastic prices: exact and approximate algorithms (Q621973) (← links)
- Exploring greedy criteria for the dynamic traveling purchaser problem (Q623757) (← links)
- A heuristic approach for the travelling purchaser problem (Q707139) (← links)
- Models for a traveling purchaser problem with additional side-constraints (Q709202) (← links)
- Solving the asymmetric traveling purchaser problem (Q867540) (← links)
- The traveling purchaser problem with budget constraint (Q1013406) (← links)
- Transgenetic algorithm for the traveling purchaser problem (Q1042095) (← links)
- A branch and bound algorithm for the traveling purchaser problem (Q1278659) (← links)
- Improved solutions for the traveling purchaser problem. (Q1406699) (← links)
- Improved heuristics for the traveling purchaser problem. (Q1422388) (← links)
- The bi-objective traveling purchaser problem with deliveries (Q1622816) (← 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)
- Approximate algorithms for the travelling purchaser problem (Q1835850) (← links)
- Heuristics for the traveling purchaser problem (Q1870801) (← links)
- The biobjective travelling purchaser problem (Q1885751) (← links)
- Dynamic tabu search strategies for the traveling purchaser problem (Q1919843) (← links)
- Parameterized algorithms and complexity for the traveling purchaser problem and its variants (Q2084609) (← links)
- Ant colony optimization for the traveling purchaser problem (Q2384913) (← links)
- An approach to efficient planning with numerical fluents and multi-criteria plan quality (Q2389640) (← links)
- A travelling salesman problem (TSP) with multiple job facilities. (Q2467832) (← links)
- The traveling purchaser problem with fast service option (Q2669765) (← links)
- A Variable Neighborhood Search Algorithm for Cost-Balanced Travelling Salesman Problem (Q5011677) (← links)
- Effective Algorithms for a Bounded Version of the Uncapacitated TPP (Q5850941) (← links)
- A GRASP/Path‐Relinking algorithm for the traveling purchaser problem (Q6056165) (← links)
