Our research group works with the following main approaches:

• Integer Programming (IP)
• Constraint Logic Programming (CLP)
• Hybrid Algorithms (IP+CLP)
• Approximation Algorithms
• Lagrangian Relaxation
• Metaheuristics: Genetic Algorithms and Tabu Search

The problems we have been working with include:

• Crew Management: Scheduling and Rostering
• Bus Scheduling
• Nurse Rostering
• Distribution Logistics
• Vehicle Routing
• Task Scheduling for Oil Well Perforation
• Resource Sequencing and Routing
• Packing and Cutting-Stock Problems
• Traveling Salesman Problem
• Computational Geometry (RG-NLP)