Pages that link to "Item:Q1991103"
From MaRDI portal
The following pages link to Revisiting dynamic programming for precedence-constrained traveling salesman problem and its time-dependent generalization (Q1991103):
Displaying 10 items.
- A pattern recognition lexi search approach to generalized time-dependent travelling salesman problem (Q505113) (← links)
- The time-dependent capacitated profitable tour problem with time windows and precedence constraints (Q1681438) (← links)
- PCGLNS: a heuristic solver for the precedence constrained generalized traveling salesman problem (Q2679785) (← links)
- On the effect of precedence constraints on computational complexity of dynamic programming method for routing problems (Q2932440) (← links)
- Dynamic Programming Strategies for the Traveling Salesman Problem with Time Window and Precedence Constraints (Q4367231) (← links)
- Constrained TSP and low-power computing (Q5096929) (← links)
- Dynamic programming in the routing problem: decomposition variant (Q5097703) (← links)
- Improving dynamic programming for travelling salesman with precedence constraints: parallel Morin–Marsten bounding (Q5865336) (← links)
- Solving the traveling salesperson problem with precedence constraints by deep reinforcement learning (Q6041315) (← links)
- Precedence constrained generalized traveling salesman problem: polyhedral study, formulations, and branch-and-cut algorithm (Q6112583) (← links)