Pages that link to "Item:Q1919843"
From MaRDI portal
The following pages link to Dynamic tabu search strategies for the traveling purchaser problem (Q1919843):
Displaying 19 items.
- The multi-vehicle traveling purchaser problem with pairwise incompatibility constraints and unitary demands: a branch-and-price approach (Q320623) (← links)
- The traveling purchaser problem, with multiple stacks and deliveries: a branch-and-cut approach (Q336445) (← links)
- An effective matheuristic for the capacitated total quantity discount problem (Q336744) (← links)
- The traveling purchaser problem with stochastic prices: exact and approximate algorithms (Q621973) (← 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)
- 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)
- Heuristics for the traveling purchaser problem (Q1870801) (← links)
- Metaheuristics: A bibliography (Q1919858) (← links)
- Advanced greedy algorithms and surrogate constraint methods for linear and quadratic knapsack and covering problems (Q2355937) (← links)
- Ant colony optimization for the traveling purchaser problem (Q2384913) (← links)
- The traveling purchaser problem with fast service option (Q2669765) (← links)
- A GRASP/Path‐Relinking algorithm for the traveling purchaser problem (Q6056165) (← links)