Pages that link to "Item:Q839902"

The following pages link to New neighborhood structures for the double traveling salesman problem with multiple stacks (Q839902):

Displaying 13 items.

• The traveling purchaser problem, with multiple stacks and deliveries: a branch-and-cut approach (Q336445) (← links)
• Exact algorithms for the double vehicle routing problem with multiple stacks (Q342039) (← links)
• Routing problems with loading constraints (Q610992) (← links)
• Bounded coloring of co-comparability graphs and the pickup and delivery tour combination problem (Q653316) (← links)
• Consideration of triple bottom line objectives for sustainability in the optimization of vehicle routing and loading operations: a systematic literature review (Q1730669) (← links)
• Multiple pickup and delivery traveling salesman problem with last-in-first-out loading and distance constraints (Q1926986) (← links)
• Approximation of the double traveling salesman problem with multiple stacks (Q2034797) (← links)
• Effectiveness of carbon pricing policies for promoting urban freight electrification: analysis of last mile delivery in Madrid (Q2228276) (← links)
• Using intermediate infeasible solutions to approach vehicle routing problems with precedence and loading constraints (Q2275601) (← links)
• (Q2861493) (← links)
• Improved exact method for the double TSP with multiple stacks (Q3113513) (← links)
• A dynamic programming based local search approach for the double traveling salesman problem with multiple stacks (Q5246822) (← links)
• A metaheuristic for the double traveling salesman problem with partial last‐in‐first‐out loading constraints (Q6080619) (← links)