The following pages link to Marco Casazza (Q336980):
Displaying 10 items.
- Mathematical programming algorithms for bin packing problems with item fragmentation (Q336982) (← links)
- Exactly solving packing problems with fragmentation (Q342536) (← links)
- Column generation for the variable cost and size bin packing problem with fragmentation (Q510930) (← links)
- Efficient algorithms for the double traveling salesman problem with multiple stacks (Q1762078) (← links)
- Optimization algorithms for resilient path selection in networks (Q2027082) (← links)
- A route decomposition approach for the single commodity split pickup and split delivery vehicle routing problem (Q2029263) (← links)
- Heuristic data-driven feasibility on integrated planning and scheduling (Q2216005) (← links)
- New formulations for variable cost and size bin packing problems with item fragmentation (Q2414120) (← links)
- Optimizing Time Slot Allocation in Single Operator Home Delivery Problems (Q2806900) (← links)
- Exact Algorithms for Maximum Lifetime Data-Gathering Tree in Wireless Sensor Networks (Q5106396) (← links)
