36 results on '"Mattia, Sara"'
Search Results
2. The follower optimality cuts for mixed integer linear bilevel programming problems
3. A New Lower Bound for the Block Relocation Problem
4. Optimization Models for Cut Sequencing
5. A Polyhedral Study of the Robust Capacitated Edge Activation Problem
6. Some Complexity Results for the Minimum Blocking Items Problem
7. The realization-independent reallocation heuristic for the stochastic container relocation problem
8. Benders Decomposition for Capacitated Network Design
9. Robust Shift Scheduling in Call Centers
10. Robust Shift Scheduling in Call Centers
11. Reformulations and complexity of the clique interdiction problem by graph mapping
12. The Two Layer Network Design Problem
13. A branch-and-cut algorithm for the restricted Block Relocation Problem
14. Metric Inequalities and the Network Loading Problem
15. A polyhedral analysis of the capacitated edge activation problem with uncertain demands
16. An optimization approach for congestion control in network routing with quality of service requirements
17. The bounded beam search algorithm for the block relocation problem
18. MIP-based heuristic approaches for the capacitated edge activation problem: the effect of non-compactness
19. Trade-off between stakeholders’ goals in the home care nurse-to-patient assignment problem
20. The capacity formulation of the capacitated edge activation problem
21. A comparison of different routing schemes for the robust network loading problem: polyhedral results and computation
22. Staffing and scheduling flexible call centers by two-stage robust optimization
23. Survivable green traffic engineering with shared protection
24. Energy-aware survivable networks
25. The cut property under demand uncertainty
26. Handling uncertainty in health care management using the cardinality-constrained approach: Advantages and remarks
27. The cut condition for robust network design
28. A Branch-and-Cut algorithm for the Single Source Capacitated Facility Location problem
29. Mixed integer lifted cover inequalities for knapsack problems with a single continuous variable
30. A polyhedral study of the capacity formulation of the multilayer network design problem
31. Separating tight metric inequalities by bilevel programming
32. The robust network loading problem with dynamic routing
33. Bounded coloring of co-comparability graphs and the pickup and delivery tour combination problem
34. Solving survivable two-layer network design problems by metric inequalities
35. Metric inequalities and the Network Loading Problem
36. Using mixed-integer programming to solve power grid blackout problems
Catalog
Books, media, physical & digital resources
Discovery Service for Jio Institute Digital Library
For full access to our library's resources, please sign in.