Pages that link to "Item:Q4367231"

The following pages link to Dynamic Programming Strategies for the Traveling Salesman Problem with Time Window and Precedence Constraints (Q4367231):

Displaying 32 items.

• The shortest-path problem with resource constraints with \((k, 2)\)-loop elimination and its application to the capacitated arc-routing problem (Q296774) (← links)
• An enhanced branch-and-bound algorithm for the talent scheduling problem (Q322481) (← links)
• The delivery man problem with time windows (Q429673) (← links)
• Single-vehicle scheduling with time window constraints (Q1297696) (← links)
• Shipping problems with body clock constraints. (Q1423446) (← links)
• A tabu search algorithm for scheduling a single robot in a job-shop environment (Q1602712) (← links)
• A traveling salesman problem with pickups and deliveries, time windows and draft limits: case study from chemical shipping (Q1652016) (← links)
• The time-dependent capacitated profitable tour problem with time windows and precedence constraints (Q1681438) (← links)
• Exact and heuristic algorithms for routing AGV on path with precedence constraints (Q1793242) (← links)
• An efficient genetic algorithm for the traveling salesman problem with precedence constraints (Q1848588) (← links)
• The single vehicle routing problem with toll-by-weight scheme: a branch-and-bound approach (Q1926737) (← links)
• Revisiting dynamic programming for precedence-constrained traveling salesman problem and its time-dependent generalization (Q1991103) (← links)
• Iterated maximum large neighborhood search for the traveling salesman problem with time windows and its time-dependent version (Q2108179) (← links)
• A hybrid algorithm for the vehicle routing problem with and/or precedence constraints and time windows (Q2147032) (← links)
• Deep policy dynamic programming for vehicle routing problems (Q2170197) (← links)
• Exact and heuristic dynamic programming algorithms for the traveling salesman problem with flexible time windows (Q2174903) (← links)
• Optimal toll design: a lower bound framework for the asymmetric traveling salesman problem (Q2452379) (← links)
• New cutting-planes for the time- and/or precedence-constrained ATSP and directed VRP (Q2466786) (← links)
• Nodal aggregation of resource constraints in a shortest path problem (Q2490165) (← links)
• An exact dynamic programming algorithm for the precedence-constrained class sequencing problem (Q2664413) (← links)
• Solving the time dependent minimum tour duration and delivery man problems with dynamic discretization discovery (Q2672110) (← links)
• An exact constraint logic programming algorithm for the traveling salesman problem with time windows (Q2783791) (← links)
• A time bucket formulation for the traveling salesman problem with time windows (Q2815434) (← links)
• New state-space relaxations for solving the traveling salesman problem with time windows (Q2815450) (← links)
• On the effect of precedence constraints on computational complexity of dynamic programming method for routing problems (Q2932440) (← links)
• An Optimal Algorithm for the Traveling Salesman Problem with Time Windows (Q4849335) (← links)
• Dynamic Programming for the Time-Dependent Traveling Salesman Problem with Time Windows (Q5060801) (← links)
• The Vehicle Routing Problem with Floating Targets: Formulation and Solution Approaches (Q5136080) (← links)
• Network-Based Approximate Linear Programming for Discrete Optimization (Q5144795) (← links)
• New integer linear programming formulation for the traveling salesman problem with time windows: minimizing tour duration with waiting times (Q5746675) (← links)
• Improving dynamic programming for travelling salesman with precedence constraints: parallel Morin–Marsten bounding (Q5865336) (← links)
• Scheduling tasks on moving executors to minimise the maximum lateness (Q5937357) (← links)