Pages that link to "Item:Q5326779"

The following pages link to A branch‐and‐bound algorithm for the double travelling salesman problem with two stacks (Q5326779):

Displaying 18 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)
• An adapted heuristic approach for a clustered traveling salesman problem with loading constraints (Q693154) (← links)
• What are the worst cases in constrained last-in-first-out pick-up and delivery problems? (Q1651694) (← links)
• Consideration of triple bottom line objectives for sustainability in the optimization of vehicle routing and loading operations: a systematic literature review (Q1730669) (← links)
• Polyhedral results and a branch-and-cut algorithm for the double traveling salesman problem with multiple stacks (Q1751162) (← links)
• Efficient algorithms for the double traveling salesman problem with multiple stacks (Q1762078) (← links)
• Multiple pickup and delivery traveling salesman problem with last-in-first-out loading and distance constraints (Q1926986) (← links)
• Vehicle routing problems with loading constraints: state-of-the-art and future directions (Q2018104) (← links)
• Approximation of the double traveling salesman problem with multiple stacks (Q2034797) (← links)
• The pickup and delivery problem with time windows, multiple stacks, and handling operations (Q2140213) (← 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)
• A dynamic programming based local search approach for the double traveling salesman problem with multiple stacks (Q5246822) (← links)
• A branch‐and‐cut algorithm for the pickup and delivery traveling salesman problem with multiple stacks (Q5326770) (← 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)
• The constrained forward shortest path tour problem: Mathematical modeling and GRASP approximate solutions (Q6087141) (← links)