The following pages link to Haroldo Gambini Santos (Q284394):
Displayed 27 items.
- GOAL solver: a hybrid local search based solver for high school timetabling (Q284398) (← links)
- Integer programming techniques for the nurse rostering problem (Q284423) (← links)
- (Q309066) (redirect page) (← links)
- Late acceptance hill-climbing for high school timetabling (Q309068) (← links)
- An integer programming approach to the multimode resource-constrained multiproject scheduling problem (Q310345) (← links)
- A computational study of conflict graphs and aggressive cut separation in integer programming (Q324843) (← links)
- Variable neighborhood search based algorithms for high school timetabling (Q337210) (← links)
- Integrating matheuristics and metaheuristics for timetabling (Q342465) (← links)
- (Q475205) (redirect page) (← links)
- XHSTT: an XML archive for high school timetabling problems in different countries (Q475206) (← links)
- (Q992716) (redirect page) (← links)
- A hybrid heuristic algorithm for the open-pit-mining operational planning problem (Q992718) (← links)
- Automatic integer programming reformulation using variable neighborhood search (Q1687624) (← links)
- Variable neighborhood search accelerated column generation for the nurse rostering problem (Q1687629) (← links)
- Drawing graphs with mathematical programming and variable neighborhood search (Q1687683) (← links)
- Limited memory rank-1 cuts for vehicle routing problems (Q1728212) (← links)
- Integer programming techniques for educational timetabling (Q1754009) (← links)
- Strong bounds with cut and column generation for class-teacher timetabling (Q1761917) (← links)
- Optimal decision trees for feature based parameter tuning: integer programming model and VNS heuristic (Q1791966) (← links)
- Preprocessing and cutting planes with conflict graphs (Q2027062) (← links)
- Strong bounds for resource constrained project scheduling: preprocessing and cutting planes (Q2333144) (← links)
- Cover by disjoint cliques cuts for the knapsack problem with conflicting items (Q2670441) (← links)
- A SA-VNS approach for the High School Timetabling Problem (Q2840769) (← links)
- A Tabu search heuristic with efficient diversification strategies for the class/teacher timetabling problem (Q3507753) (← links)
- Analysis of stochastic local search methods for the unrelated parallel machine scheduling problem (Q6070990) (← links)
- Optimal decision trees for the algorithm selection problem: integer programming based approaches (Q6092614) (← links)
- Preprocessing and Cutting Planes with Conflict Graphs (Q6325473) (← links)