The following pages link to Daniele Manerba (Q320622):
Displaying 14 items.
- The multi-vehicle traveling purchaser problem with pairwise incompatibility constraints and unitary demands: a branch-and-price approach (Q320623) (← links)
- An effective matheuristic for the capacitated total quantity discount problem (Q336744) (← links)
- New solution approaches for the capacitated supplier selection problem with total quantity discount and activation costs under demand uncertainty (Q1628038) (← links)
- The traveling purchaser problem and its variants (Q1751767) (← links)
- A generalized bin packing problem for parcel delivery in last-mile logistics (Q1755394) (← links)
- An exact algorithm for the capacitated total quantity discount problem (Q1926936) (← links)
- Stochastic single machine scheduling problem as a multi-stage dynamic random decision process (Q2051165) (← links)
- The multi-stage dynamic stochastic decision process with unknown distribution of the random utilities (Q2191290) (← links)
- The index selection problem with configurations and memory limitation: a scatter search approach (Q2668806) (← links)
- A stochastic programming approach for the traveling purchaser problem (Q5382708) (← links)
- Hybridizing adaptive large neighborhood search with kernel search: a new solution approach for the nurse routing problem with incompatible services and minimum demand (Q6056092) (← links)
- Multiperiod transshipment location–allocation problem with flow synchronization under stochastic handling operations (Q6087146) (← links)
- The synchronized multi-commodity multi-service transshipment-hub location problem with cyclic schedules (Q6106592) (← links)
- Optimal Seating Assignment in the COVID-19 Era via Quantum Computing (Q6110176) (← links)
