The following pages link to Andrea Bettinelli (Q340298):
Displaying 10 items.
- The anonymous subgraph problem (Q340300) (← links)
- A branch-and-price algorithm for the variable size bin packing problem with minimum filling constraint (Q610980) (← links)
- A branch-and-price algorithm for the multi-depot heterogeneous-fleet pickup and delivery problem with soft time windows (Q892384) (← links)
- Community detection with the weighted parsimony criterion (Q904925) (← links)
- A branch-and-price algorithm for the two-dimensional level strip packing problem (Q1029564) (← links)
- A branch-and-cut-and-price algorithm for the multi-trip separate pickup and delivery problem with time windows at customers and facilities (Q2315637) (← links)
- An overview of curriculum-based course timetabling (Q2355018) (← links)
- Rejoinder on: ``An overview of curriculum-based course timetabling'' (Q2355019) (← links)
- A Branch-and-Bound Algorithm for the Knapsack Problem with Conflict Graph (Q4599315) (← links)
- A Mixed-Integer Linear Program to create the shifts in a supermarket (Q6527812) (← links)
