Pages that link to "Item:Q1751162"

The following pages link to Polyhedral results and a branch-and-cut algorithm for the double traveling salesman problem with multiple stacks (Q1751162):

Displaying 9 items.

• The double traveling salesman problem with multiple stacks: A variable neighborhood search approach (Q1025245) (← links)
• Efficient algorithms for the double traveling salesman problem with multiple stacks (Q1762078) (← links)
• Approximation of the double traveling salesman problem with multiple stacks (Q2034797) (← links)
• Valid inequalities and branch-and-cut algorithm for the pickup and delivery traveling salesman problem with multiple stacks (Q2670579) (← links)
• A Set Covering Approach for the Double Traveling Salesman Problem with Multiple Stacks (Q2835682) (← links)
• An exact method for the double TSP with multiple stacks (Q3002549) (← links)
• The double traveling salesman problem with partial last‐in‐first‐out loading constraints (Q6071059) (← links)
• A metaheuristic for the double traveling salesman problem with partial last‐in‐first‐out loading constraints (Q6080619) (← links)
• A variable neighborhood search heuristic algorithm for the double vehicle routing problem with multiple stacks (Q6088235) (← links)