The following pages link to Alessandro Hill (Q286686):
Displaying 14 items.
- Optimal capacitated ring trees (Q286687) (← links)
- The ring tree facility location problem (Q324831) (← links)
- Exact algorithms for bi-objective ring tree problems with reliability measures (Q1652601) (← links)
- Pricing strategies for capacitated ring-star problems based on dynamic programming algorithms (Q1683123) (← links)
- Generalized local branching heuristics and the capacitated ring tree problem (Q1744240) (← links)
- A computational study of constraint programming approaches for resource-constrained project scheduling with autonomous learning effects (Q2117197) (← links)
- A branch-and-price algorithm for the ring-tree facility location problem (Q2132327) (← links)
- Optimal Steiner trees under node and edge privacy conflicts (Q2156311) (← links)
- Capacitated ring arborescence problems with profits (Q2284638) (← links)
- Branch-and-cut algorithms for Steiner tree problems with privacy conflicts (Q2300046) (← links)
- Multi-exchange Neighborhoods for the Capacitated Ring Tree Problem (Q2814545) (← links)
- Optimization Strategies for Resource-Constrained Project Scheduling Problems in Underground Mining (Q5060783) (← links)
- New pricing strategies and an effective exact solution framework for profit-oriented ring arborescence problems (Q6109802) (← links)
- Expanding students' social networks via optimized team assignments (Q6596993) (← links)
