Thiago F. Noronha

Available identifiers

zbMath Open noronha.thiago-fMaRDI QIDQ312486

List of research outcomes

Publication	Date of Publication	Type
Fix-and-optimize metaheuristics for minmax regret binary integer programming problems under interval uncertainty	2024-02-02	Paper
Exact algorithms for the product configuration problem	2023-10-04	Paper
A fix‐and‐optimize heuristic for the minmax regret shortest path arborescence problem under interval uncertainty	2023-09-29	Paper
Robust min-max regret covering problems	2022-08-08	Paper
A column generation and a post optimization VNS heuristic for the vehicle routing problem with multiple time Windows	2022-01-21	Paper
A min-max regret approach for the Steiner Tree Problem with Interval Costs	2021-01-09	Paper
A biased random-key genetic algorithm for routing and wavelength assignment under a sliding scheduled traffic model	2020-08-07	Paper
On the problem of minimizing the cost with optical devices in Wavelength Division Multiplexing optical networks: complexity analysis, mathematical formulation and improved heuristics	2020-02-07	Paper
A MILP-based VND for the min-max regret shortest path tree problem with interval costs	2018-10-11	Paper
Variable neighborhood search for vehicle routing problem with multiple time windows	2018-10-11	Paper
A linear programming based heuristic framework for min-max regret combinatorial optimization problems with interval costs	2018-07-11	Paper
Formulation and algorithms for the robust maximal covering location problem	2018-04-11	Paper
Heuristic and exact algorithms for product configuration in software product lines	2018-01-24	Paper
A multi‐agent framework to build integer programming applications to playoff elimination in sports tournaments	2018-01-12	Paper
Erratum to: ``An integer linear programming formulation and heuristics for the minmax relative regret robust shortest path problem	2017-11-02	Paper
A biased random‐key genetic algorithm for scheduling heterogeneous multi‐round systems	2017-10-02	Paper
On the Finite Optimal Convergence of Logic-Based Benders’ Decomposition in Solving 0–1 Min-Max Regret Optimization Problems with Interval Costs	2016-11-30	Paper
A biased random-key genetic algorithm to maximize the number of accepted lightpaths in WDM optical networks	2016-09-15	Paper
A biased random-key genetic algorithm for single-round divisible load scheduling	2016-05-18	Paper
A branch-and-cut algorithm for the equitable coloring problem using a formulation by representatives	2015-09-22	Paper
Heuristics and matheuristics for a real‐life machine reassignment problem	2015-04-22	Paper
An integer linear programming formulation and heuristics for the minmax relative regret robust shortest path problem	2015-01-15	Paper
A Branch-and-Cut Algorithm for Equitable Coloring based on a Formulation by Representatives	2013-07-19	Paper
Solving diameter-constrained minimum spanning tree problems by constraint programming	2011-05-20	Paper
A branch-and-cut algorithm for partition coloring	2010-11-24	Paper
An efficient implementation of a VNS/ILS heuristic for a real-life car sequencing problem	2008-07-10	Paper
A hybrid heuristic for a multi-objective real-life car sequencing problem with painting and assembly line constraints	2008-07-10	Paper
Constraint Programming for the Diameter Constrained Minimum Spanning Tree Problem	2008-06-05	Paper
Routing and wavelength assignment by partition colouring	2006-03-22	Paper

Research outcomes over time

This page was built for person: Thiago F. Noronha