Pages that link to "Item:Q1278659"
From MaRDI portal
The following pages link to A branch and bound algorithm for the traveling purchaser problem (Q1278659):
Displaying 26 items.
- 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)
- 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)
- The biobjective travelling purchaser problem (Q1885751) (← links)
- Parameterized algorithms and complexity for the traveling purchaser problem and its variants (Q2084609) (← links)
- A branch-price-and-cut algorithm for the capacitated multiple vehicle traveling purchaser problem with unitary demand (Q2208355) (← links)
- A branch-and-cut algorithm for the target visitation problem (Q2294072) (← links)
- Parameterized algorithms for the Traveling Purchaser problem with additional constraints (Q2300071) (← links)
- Ant colony optimization for the traveling purchaser problem (Q2384913) (← links)
- The traveling purchaser problem with fast service option (Q2669765) (← links)
- Logic-Based Decomposition Methods for the Travelling Purchaser Problem (Q2815095) (← links)
- Automatic production planning of press brakes for sheet metal bending (Q3432666) (← links)
- A Branch-and-Cut Algorithm for the Undirected Traveling Purchaser Problem (Q3637400) (← 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)
- Heuristic approaches for the family traveling salesman problem (Q6070420) (← links)