Pages that link to "Item:Q5287441"
From MaRDI portal
The following pages link to The traveling salesman problem with cumulative costs (Q5287441):
Displayed 18 items.
- Mathematical formulations and exact algorithm for the multitrip cumulative capacitated single-vehicle routing problem (Q320880) (← links)
- The delivery man problem with time windows (Q429673) (← links)
- Exact and heuristic solutions to minimize total waiting time in the blood products distribution problem (Q447561) (← links)
- Natural and extended formulations for the time-dependent traveling salesman problem (Q496646) (← links)
- Efficient GRASP+VND and GRASP+VNS metaheuristics for the traveling repairman problem (Q548680) (← links)
- The time-dependent traveling salesman problem and single machine scheduling problems with sequence dependent setup times (Q955327) (← links)
- An effective memetic algorithm for the cumulative capacitated vehicle routing problem (Q975996) (← links)
- A classification of formulations for the (time-dependent) traveling salesman problem (Q1388929) (← links)
- Solving the continuous flow-shop scheduling problem by metaheuristics. (Q1410624) (← links)
- A branch-and-price algorithm for the minimum latency problem (Q1652580) (← links)
- A performance study on multi improvement neighborhood search strategy (Q1687681) (← links)
- Routing problems: A bibliography (Q1908308) (← links)
- The single vehicle routing problem with toll-by-weight scheme: a branch-and-bound approach (Q1926737) (← links)
- A simple and effective metaheuristic for the minimum latency problem (Q1926884) (← links)
- Branch-and-price-and-cut for the multiple traveling repairman problem with distance constraints (Q2256169) (← links)
- A multistart iterated local search for the multitrip cumulative capacitated vehicle routing problem (Q2340494) (← links)
- A heuristic for cumulative vehicle routing using column generation (Q2357169) (← links)
- A bicriteria scheduling with sequence-dependent setup times (Q2506355) (← links)