The following pages link to Thiago F. Noronha (Q312486):
Displaying 10 items.
- A biased random-key genetic algorithm to maximize the number of accepted lightpaths in WDM optical networks (Q312488) (← links)
- An integer linear programming formulation and heuristics for the minmax relative regret robust shortest path problem (Q486397) (← links)
- A branch-and-cut algorithm for the equitable coloring problem using a formulation by representatives (Q496694) (← links)
- A biased random-key genetic algorithm for routing and wavelength assignment under a sliding scheduled traffic model (Q785640) (← links)
- Routing and wavelength assignment by partition colouring (Q819072) (← links)
- An efficient implementation of a VNS/ILS heuristic for a real-life car sequencing problem (Q932175) (← links)
- A hybrid heuristic for a multi-objective real-life car sequencing problem with painting and assembly line constraints (Q932216) (← links)
- A linear programming based heuristic framework for min-max regret combinatorial optimization problems with interval costs (Q1652219) (← links)
- Formulation and algorithms for the robust maximal covering location problem (Q1742214) (← links)
- Heuristic and exact algorithms for product configuration in software product lines (Q4601627) (← links)
