395 results on '"Caprara, Alberto"'
Search Results
2. Modeling and Solving the Train Timetabling Problem
3. A Heuristic Method for the Set Covering Problem
4. Modeling and Solving the Crew Rostering Problem
5. A Complexity and Approximability Study of the Bilevel Knapsack Problem
6. Models and Algorithms for the Train Unit Assignment Problem
7. Partial Convexification of General MIPs by Dantzig-Wolfe Reformulation
8. An Effective Branch-and-Bound Algorithm for Convex Quadratic Integer Programming
9. Practical Solution of Periodic Filtered Approximation as a Convex Quadratic Integer Program
10. A Structural Lemma in 2-Dimensional Packing, and Its Implications on Approximability
11. Delay-Robust Event Scheduling
12. Bilevel knapsack with interdiction constraints
13. Theoretical and computational results about optimality-based domain reductions
14. Bidimensional Packing by Bilinear Programming
15. A Lagrangian heuristic for a train-unit assignment problem
16. An Approximation Scheme for the Two-Stage, Two-Dimensional Bin Packing Problem
17. On the Practical Solution of the Reversal Median Problem
18. Packing Cycles and Cuts in Undirected Graphs
19. Approximation Schemes for Ordered Vector Packing Problems
20. A Global Method for Crew Planning in Railway Applications
21. Experimental and Statistical Analysis of Sorting by Reversals
22. Wavelength Rerouting in Optical Networks, or the Venetian Routing Problem
23. On the Separation of Maximally Violated mod-k Cuts
24. Solution of Large-Scale Railway Crew Planning Problems: the Italian Experience
25. Friendly bin packing instances without Integer Round-up Property
26. Automatic Dantzig–Wolfe reformulation of mixed integer programs
27. Railway Rolling Stock Planning: Robustness Against Large Disruptions
28. A Lagrangian Heuristic for Robustness, with an Application to Train Timetabling
29. A Freight Service Design Problem for a Railway Corridor
30. Solution of the Train Platforming Problem
31. Crew Scheduling and Rostering Problems in Railway Applications
32. Packing d-Dimensional Bins in d Stages
33. A heuristic algorithm for the set covering problem
34. A Heuristic Algorithm for Very-Large Scale Set Covering Problems
35. Fast Approximation Schemes for Two-Stage, Two-Dimensional Bin Packing
36. Scheduling extra freight trains on railway networks
37. An approximation scheme for the two-stage, two-dimensional knapsack problem
38. Uncommon Dantzig-Wolfe reformulation for the temporal knapsack problem
39. Finding cliques of maximum weight on a generalization of permutation graphs
40. An effective branch-and-bound algorithm for convex quadratic integer programming
41. Optimal linear arrangements using betweenness variables
42. Constrained 0–1 quadratic programming: Basic approaches and extensions
43. Decorous lower bounds for minimum linear arrangement
44. Global optimization problems and domain reduction strategies
45. New techniques for cost sharing in combinatorial optimization games
46. Solving a real-world train-unit assignment problem
47. Bidimensional packing by bilinear programming
48. A column generation approach to train timetabling on a corridor
49. A branch-and-cut algorithm for multiple sequence alignment
50. Embedding {0, 1/2}-cuts in a branch-and-cut framework: a computational study
Catalog
Books, media, physical & digital resources
Discovery Service for Jio Institute Digital Library
For full access to our library's resources, please sign in.