Pages that link to "Item:Q336445"

The following pages link to The traveling purchaser problem, with multiple stacks and deliveries: a branch-and-cut approach (Q336445):

Displaying 9 items.

• The multi-vehicle traveling purchaser problem with pairwise incompatibility constraints and unitary demands: a branch-and-price approach (Q320623) (← links)
• The merchant subtour problem (Q1411616) (← links)
• The bi-objective traveling purchaser problem with deliveries (Q1622816) (← links)
• Formulations and algorithms for the pickup and delivery traveling salesman problem with multiple stacks (Q1652571) (← links)
• Consideration of triple bottom line objectives for sustainability in the optimization of vehicle routing and loading operations: a systematic literature review (Q1730669) (← links)
• The traveling purchaser problem and its variants (Q1751767) (← links)
• The pickup and delivery problem with time windows, multiple stacks, and handling operations (Q2140213) (← links)
• The traveling purchaser problem with fast service option (Q2669765) (← links)
• Valid inequalities and branch-and-cut algorithm for the pickup and delivery traveling salesman problem with multiple stacks (Q2670579) (← links)