Pages that link to "Item:Q4367231"
From MaRDI portal
The following pages link to Dynamic Programming Strategies for the Traveling Salesman Problem with Time Window and Precedence Constraints (Q4367231):
Displayed 11 items.
- 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)
- 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)
- 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)
- New integer linear programming formulation for the traveling salesman problem with time windows: minimizing tour duration with waiting times (Q5746675) (← links)
- Scheduling tasks on moving executors to minimise the maximum lateness (Q5937357) (← links)