The following pages link to Laura Galli (Q408379):
Displaying 24 items.
- Gap inequalities for non-convex mixed-integer quadratic programs (Q408381) (← links)
- Complexity results for the gap inequalities for the max-cut problem (Q439900) (← links)
- Combinatorial and robust optimisation models and algorithms for railway applications (Q548671) (← links)
- Small bipartite subgraph polytopes (Q613319) (← links)
- An electromagnetism metaheuristic for the unicost set covering problem (Q976443) (← links)
- Delay-constrained routing problems: accurate scheduling models and admission control (Q1652220) (← links)
- New valid inequalities and facets for the simple plant location problem (Q1749485) (← links)
- On the Lovász theta function and some variants (Q1751239) (← links)
- Polynomial-size formulations and relaxations for the quadratic multiple knapsack problem (Q2030649) (← links)
- A Lagrangian approach to chance constrained routing with local broadcast (Q2056917) (← links)
- A separation algorithm for the simple plant location problem (Q2060615) (← links)
- A MILP approach to DRAM access worst-case analysis (Q2147044) (← links)
- Valid inequalities for quadratic optimisation with domain constraints (Q2234747) (← links)
- A binarisation heuristic for non-convex quadratic programming with box constraints (Q2294229) (← links)
- Delay-constrained shortest paths: approximation algorithms and second-order cone models (Q2342143) (← links)
- A compact variant of the QCR method for quadratically constrained quadratic \(0-1\) programs (Q2448194) (← links)
- Delay-Robust Event Scheduling (Q2875596) (← links)
- Robust train routing and online re-scheduling (Q2917284) (← links)
- Recoverable Robustness for Railway Rolling Stock Planning (Q2917356) (← links)
- 04. Solution of the Train Platforming Problem (Q2917365) (← links)
- Gap Inequalities for the Max-Cut Problem: A Cutting-Plane Algorithm (Q3167623) (← links)
- Strong Formulations for the Multi-module PESP and a Quadratic Algorithm for Graphical Diophantine Equation Systems (Q3586475) (← links)
- Optimization Methods: An Applications-Oriented Primer (Q5154449) (← links)
- Lagrangian matheuristics for the quadratic multiple knapsack problem (Q6041829) (← links)