The following pages link to Luca Bertazzi (Q415369):
Displaying 36 items.
- Minimum and worst-case performance ratios of rollout algorithms (Q415370) (← links)
- Analysis of the best double frequency policy in the single link problem with discrete shipping times (Q467486) (← links)
- Solution approaches for the stochastic capacitated traveling salesmen location problem with recourse (Q493248) (← links)
- A stochastic multi-stage fixed charge transportation problem: worst-case analysis of the rolling horizon approach (Q723935) (← links)
- An inventory-transportation system with stochastic demand (Q744222) (← links)
- Rounding procedures for the discrete version of the capacitated economic order quantity problem (Q1599326) (← links)
- Faster rollout search for the vehicle routing problem with stochastic demands and restocking (Q1651700) (← links)
- Stochastic optimization models for a bike-sharing problem with transshipment (Q1728505) (← links)
- The undirected capacitated general routing problem with profits (Q1752868) (← links)
- Dynamic expediting of an urgent order with uncertain progress (Q1754209) (← links)
- Improved rounding procedures for the discrete version of the capacitated EOQ problem (Q1779529) (← links)
- The value of the right distribution in stochastic programming with application to a Newsvendor problem (Q2010381) (← links)
- Direct \(k\)-routing versus cross-docking: worst-case results (Q2037884) (← links)
- Analysis of effective sets of routes for the split-delivery periodic inventory routing problem (Q2076819) (← links)
- A rolling horizon approach for a multi-stage stochastic fixed-charge transportation problem with transshipment (Q2140274) (← links)
- Stochastic optimization models for a single-sink transportation problem (Q2271804) (← links)
- An exact approach for cyclic inbound inventory routing in a level production system (Q2294631) (← links)
- The bin packing problem with item fragmentation: a worst-case analysis (Q2414454) (← links)
- Polynomial cases of the economic lot sizing problem with cost discounts (Q2514883) (← links)
- Min-Max vs. Min-Sum vehicle routing: a worst-case analysis (Q2629640) (← links)
- Exact and Heuristic Solutions for a Shipment Problem with Given Frequencies (Q3116771) (← links)
- Analysis of Direct Shipping Policies in an Inventory-Routing Problem with Discrete Shipping Times (Q3117701) (← links)
- Analysis of practical policies for a single link distribution system (Q3524587) (← links)
- Inventory Routing (Q3564349) (← links)
- (Q3839027) (← links)
- Minimizing logistic costs in multistage supply chains (Q4261220) (← links)
- (Q4356880) (← links)
- Continuous and Discrete Shipping Strategies for the Single Link Problem (Q4408701) (← links)
- (Q4495280) (← links)
- (Q4495282) (← links)
- Technical Note—Worst-Case Benefit of Restocking for the Vehicle Routing Problem with Stochastic Demands (Q5130499) (← links)
- Optimizing the Storage Area Dimension in a Production System (Q5850923) (← links)
- Matheuristics with performance guarantee for the unsplit and split delivery capacitated vehicle routing problem (Q6085887) (← links)
- Recent challenges in Routing and Inventory Routing: E‐commerce and last‐mile delivery (Q6087075) (← links)
- The inventory routing problem with split deliveries (Q6180028) (← links)
- An improved model for estimating optimal VRP solution values (Q6204199) (← links)
