Pages that link to "Item:Q3637400"
From MaRDI portal
The following pages link to A Branch-and-Cut Algorithm for the Undirected Traveling Purchaser Problem (Q3637400):
Displayed 25 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)
- 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)
- The bi-objective traveling purchaser problem with deliveries (Q1622816) (← links)
- New solution approaches for the capacitated supplier selection problem with total quantity discount and activation costs under demand uncertainty (Q1628038) (← links)
- The traveling purchaser problem with time-dependent quantities (Q1652259) (← links)
- The bi-objective insular traveling salesman problem with maritime and ground transportation costs (Q1653384) (← links)
- The traveling purchaser problem and its variants (Q1751767) (← links)
- Outer approximation and submodular cuts for maximum capture facility location problems with random utilities (Q1754055) (← links)
- Solving school bus routing using the multiple vehicle traveling purchaser problem: a branch-and-cut approach (Q1761989) (← links)
- Heuristics for the traveling purchaser problem (Q1870801) (← links)
- The biobjective travelling purchaser problem (Q1885751) (← links)
- An exact algorithm for the capacitated total quantity discount problem (Q1926936) (← 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)
- Ant colony optimization for the traveling purchaser problem (Q2384913) (← links)
- A GRASP for simultaneously assigning and sequencing product families on flexible assembly lines (Q2393485) (← links)
- A production scheduling heuristic for an electronics manufacturer with sequence-dependent setup costs (Q2467257) (← links)
- The traveling purchaser problem with fast service option (Q2669765) (← 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)