The following pages link to Michele Monaci (Q266411):
Displayed 19 items.
- (Q3059312) (← links)
- Three Ideas for the Quadratic Assignment Problem (Q3144407) (← links)
- Intersection Cuts for Bilevel Optimization (Q3186493) (← links)
- Bidimensional Packing by Bilinear Programming (Q3596354) (← links)
- Light Robustness (Q3649159) (← links)
- (Q4452972) (← links)
- A New General-Purpose Algorithm for Mixed-Integer Bilevel Linear Programs (Q4602475) (← links)
- (Q4737536) (← links)
- Network Design with Service Requirements: Scaling-up the Size of Solvable Problems (Q5058001) (← links)
- Interdiction Games and Monotonicity, with Application to Knapsack Problems (Q5138270) (← links)
- Exploiting Erraticism in Search (Q5166303) (← links)
- On the Robust Knapsack Problem (Q5408207) (← links)
- Fast Approximation Schemes for Two-Stage, Two-Dimensional Bin Packing (Q5704216) (← links)
- Adjustable robust optimization with objective uncertainty (Q6069242) (← links)
- In search of dense subgraphs: How good is greedy peeling? (Q6087137) (← links)
- Corrigendum to: ``Integer optimization with penalized fractional values: the knapsack case'' (Q6109854) (← links)
- A solution algorithm for chance-constrained problems with integer second-stage recourse decisions (Q6126651) (← links)
- An exact method for binary fortification games (Q6167322) (← links)
- Adjustable Robust Optimization with Discrete Uncertainty (Q6202332) (← links)