The following pages link to Lei Wu (Q322971):
Displaying 7 items.
- An exact decomposition algorithm for the generalized knapsack sharing problem (Q322972) (← links)
- New models for the robust shortest path problem: complexity, resolution and generalization (Q367636) (← links)
- New upper bounds and exact methods for the knapsack sharing problem (Q2396494) (← links)
- A linear programming approach for the three-dimensional bin-packing problem (Q2861521) (← links)
- A Fast Large Neighborhood Search for Disjunctively Constrained Knapsack Problems (Q3195349) (← links)
- Hybrid greedy heuristics based on linear programming for the three‐dimensional single bin‐size bin packing problem (Q4979988) (← links)
- A novel quantum algorithm for converting between one-hot and binary encodings (Q6550837) (← links)
