The following pages link to Andrea Tramontani (Q266413):
Displaying 17 items.
- Improving branch-and-cut performance by random sampling (Q266414) (← links)
- On the separation of disjunctive cuts (Q543404) (← links)
- Enhanced mixed integer programming techniques and routing problems (Q657574) (← links)
- An ILP improvement procedure for the open vehicle routing problem (Q991364) (← links)
- On mathematical programming with indicator constraints (Q2349121) (← links)
- Cutting planes from wide split disjunctions (Q2401148) (← links)
- A Time Bucket Formulation for the Traveling Salesman Problem with Time Windows (Q2815434) (← links)
- On the Practical Strength of Two-Row Tableau Cuts (Q2962551) (← links)
- (Q3368660) (← links)
- An Integer Linear Programming Local Search for Capacitated Vehicle Routing Problems (Q3564361) (← links)
- Experiments with Two Row Tableau Cuts (Q3569836) (← links)
- Solving Quadratic Programming by Cutting Planes (Q4634098) (← links)
- Multilevel Approaches for the Critical Node Problem (Q4994170) (← links)
- Implementing Automatic Benders Decomposition in a Modern MIP Solver (Q5041736) (← links)
- An ILP Model for Multi-Label MRFs With Connectivity Constraints (Q5105684) (← links)
- Lattice Reformulation Cuts (Q5162650) (← links)
- Cutting Planes from the Branch-and-Bound Tree: Challenges and Opportunities (Q6121571) (← links)
