The following pages link to Claudia Archetti (Q1652248):
Displaying 38 items.
- (Q296770) (redirect page) (← links)
- The clustered orienteering problem (Q296772) (← links)
- An ILP-refined tabu search for the directed profitable rural postman problem (Q406489) (← links)
- Reoptimizing the rural postman problem (Q502442) (← links)
- The probabilistic orienteering problem (Q1652250) (← links)
- The undirected capacitated general routing problem with profits (Q1752868) (← links)
- The set orienteering problem (Q1754239) (← links)
- Truck driver scheduling in Australia (Q1762092) (← links)
- Optimal solutions for routing problems with profits (Q1941380) (← links)
- The online vehicle routing problem with occasional drivers (Q2027017) (← links)
- Inventory routing in a warehouse: the storage replenishment routing problem (Q2140300) (← links)
- A genetic algorithm for the close-enough traveling salesman problem with application to solar panels diagnostic reconnaissance (Q2147130) (← links)
- Comparison of formulations for the inventory routing problem (Q2160484) (← links)
- Directed weighted improper coloring for cellular channel allocation (Q2255043) (← links)
- Dynamic traveling salesman problem with stochastic release dates (Q2327624) (← links)
- A heuristic algorithm for the free newspaper delivery problem (Q2355940) (← links)
- A branch-and-price algorithm for the robust graph coloring problem (Q2448920) (← links)
- Polynomial cases of the economic lot sizing problem with cost discounts (Q2514883) (← links)
- A matheuristic for the air transportation freight forwarder service problem (Q2664338) (← links)
- A dynamic and probabilistic orienteering problem (Q2669558) (← links)
- Pickup and delivery problems with autonomous vehicles on rings (Q2670581) (← links)
- Crowdsourced humanitarian relief vehicle routing problem (Q2676364) (← links)
- The split delivery capacitated team orienteering problem (Q2811321) (← links)
- (Q3158088) (← links)
- The capacitated team orienteering and profitable tour problems (Q3184456) (← links)
- Incomplete service and split deliveries in a routing problem with profits (Q4639689) (← links)
- Vehicle routing in the 1-skip collection problem (Q4661199) (← links)
- Vehicle routing problems with split deliveries (Q4918250) (← links)
- A branch‐and‐cut algorithm for the pickup and delivery traveling salesman problem with multiple stacks (Q5326770) (← links)
- Recent challenges in Routing and Inventory Routing: E‐commerce and last‐mile delivery (Q6087075) (← links)
- On the zero-inventory-ordering policy in the inventory routing problem (Q6087504) (← links)
- A kernel search heuristic for the multivehicle inventory routing problem (Q6092539) (← links)
- The generalized close enough traveling salesman problem (Q6113445) (← links)
- A new formulation and a branch-and-cut algorithm for the set orienteering problem (Q6128935) (← links)
- Mathematical programming formulations for the collapsed k-core problem (Q6168587) (← links)
- The hazardous orienteering problem (Q6179713) (← links)
- The inventory routing problem with split deliveries (Q6180028) (← links)
- The Bi-objective Long-haul Transportation Problem on a Road Network (Q6370233) (← links)
