Research Program
Application Domains
New Results
- An iterative dynamic programming approach for the temporal knapsack problem
- A Hypergraph Model for the Rolling Stock Rotation Planning and Train Selection Problem
- Decomposition-based approaches for a class of two-stage robust binary optimization problems
- Primal heuristic for Branch-and-Price
- Generic solver for vehicle routing problems
- New algorithms for different vehicle routing problems
- Packing problems
- Covering problems
- Software Defined Networking
Bilateral Contracts and Grants with Industry
Partnerships and Cooperations
Bibliography
Research Program
Application Domains
New Results
- An iterative dynamic programming approach for the temporal knapsack problem
- A Hypergraph Model for the Rolling Stock Rotation Planning and Train Selection Problem
- Decomposition-based approaches for a class of two-stage robust binary optimization problems
- Primal heuristic for Branch-and-Price
- Generic solver for vehicle routing problems
- New algorithms for different vehicle routing problems
- Packing problems
- Covering problems
- Software Defined Networking
Bilateral Contracts and Grants with Industry
Partnerships and Cooperations
Bibliography
Previous | 
Home