Thiago F. Noronha

Orcid: 0000-0002-6831-2006

According to our database1, Thiago F. Noronha authored at least 43 papers between 2006 and 2023.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2023
Exact algorithms for the product configuration problem.
Int. Trans. Oper. Res., November, 2023

A fix-and-optimize heuristic for the minmax regret shortest path arborescence problem under interval uncertainty.
Int. Trans. Oper. Res., 2023

2022
Fix-and-optimize metaheuristics for minmax regret binary integer programming problems under interval uncertainty.
RAIRO Oper. Res., November, 2022

A column generation and a post optimization VNS heuristic for the vehicle routing problem with multiple time windows.
Optim. Lett., 2022

Robust min-max regret covering problems.
Comput. Optim. Appl., 2022

2021
The integrated uncapacitated lot sizing and bin packing problem.
RAIRO Oper. Res., 2021

Improving logic-based Benders' algorithms for solving min-max regret problems.
Oper. Res. Decis., 2021

The Two-Dimensional Guillotine Cutting Stock Problem with Stack Constraints.
Proceedings of the XLVII Latin American Computing Conference, 2021

2020
A biased random-key genetic algorithm for routing and wavelength assignment under a sliding scheduled traffic model.
J. Glob. Optim., 2020

2019
On the problem of minimizing the cost with optical devices in Wavelength Division Multiplexing optical networks: complexity analysis, mathematical formulation and improved heuristics.
RAIRO Oper. Res., 2019

Algorithms the min-max regret 0-1 Integer Linear Programming Problem with Interval Data.
CoRR, 2019

Integer linear programming formulations for the variable data rate and variable channel bandwidth scheduling problem in wireless networks.
Comput. Networks, 2019

2018
Variable Neighborhood Search for Vehicle Routing Problem with Multiple Time Windows.
Electron. Notes Discret. Math., 2018

Formulation and algorithms for the robust maximal covering location problem.
Electron. Notes Discret. Math., 2018

A MILP-based VND for the <i>min-max</i> regret Shortest Path Tree Problem with interval costs.
Electron. Notes Discret. Math., 2018

2017
Erratum to: An integer linear programming formulation and heuristics for the minmax relative regret robust shortest path problem.
J. Glob. Optim., 2017

Heuristic and exact algorithms for product configuration in software product lines.
Int. Trans. Oper. Res., 2017

A biased random-key genetic algorithm for scheduling heterogeneous multi-round systems.
Int. Trans. Oper. Res., 2017

A linear programming based heuristic framework for min-max regret combinatorial optimization problems with interval costs.
Comput. Oper. Res., 2017

An Experimental Evaluation of the Algorithm Mean Upper Heuristic for Interval Data Min-Max Regret Combinatorial Optimization Problem.
Proceedings of the 2017 Brazilian Conference on Intelligent Systems, 2017

2016
A biased random-key genetic algorithm to maximize the number of accepted lightpaths in WDM optical networks.
J. Glob. Optim., 2016

On the Finite Optimal Convergence of Logic-Based Benders' Decomposition in Solving 0-1 Min-Max Regret Optimization Problems with Interval Costs.
Proceedings of the Combinatorial Optimization - 4th International Symposium, 2016

2015
Heuristics and matheuristics for a real-life machine reassignment problem.
Int. Trans. Oper. Res., 2015

A biased random-key genetic algorithm for single-round divisible load scheduling.
Int. Trans. Oper. Res., 2015

2014
An integer linear programming formulation and heuristics for the minmax relative regret robust shortest path problem.
J. Glob. Optim., 2014

Iterated local search heuristics for the Vehicle Routing Problem with Cross-Docking.
Expert Syst. Appl., 2014

A branch-and-cut algorithm for the equitable coloring problem using a formulation by representatives.
Discret. Appl. Math., 2014

2013
Iterated Local Search for Fiber Installation in Optical Network Optimization.
Electron. Notes Discret. Math., 2013

Improving combinatorial auctions for multi-robot exploration.
Proceedings of the 16th International Conference on Advanced Robotics, 2013

Evolutionary synthesis of robust QCA circuits.
Proceedings of the IEEE Congress on Evolutionary Computation, 2013

2012
Minimum overhearing and transmission multicast routing protocol for sensor networks.
Proceedings of the 9th ACM Symposium on Performance evaluation of wireless ad hoc, 2012

2011
A biased random-key genetic algorithm for routing and wavelength assignment.
J. Glob. Optim., 2011

Biased random-key genetic algorithm for fiber installation in Optical Network Optimization.
Proceedings of the IEEE Congress on Evolutionary Computation, 2011

2010
A branch-and-cut algorithm for partition coloring.
Networks, 2010

Solving diameter-constrained minimum spanning tree problems by constraint programming.
Int. Trans. Oper. Res., 2010

2009
A Branch-and-Cut Algorithm for Equitable Coloring based on a Formulation by Representatives.
Electron. Notes Discret. Math., 2009

2008
A multi-agent framework to build integer programming applications to playoff elimination in sports tournaments.
Int. Trans. Oper. Res., 2008

A hybrid heuristic for a multi-objective real-life car sequencing problem with painting and assembly line constraints.
Eur. J. Oper. Res., 2008

An efficient implementation of a VNS/ILS heuristic for a real-life car sequencing problem.
Eur. J. Oper. Res., 2008

Constraint Programming for the Diameter Constrained Minimum Spanning Tree Problem.
Electron. Notes Discret. Math., 2008

Efficient Implementations of Heuristics for Routing and Wavelength Assignment.
Proceedings of the Experimental Algorithms, 7th International Workshop, 2008

2006
Routing and wavelength assignment by partition colouring.
Eur. J. Oper. Res., 2006

A Branch-and-Cut Algorithm for Scheduling the Highly-Constrained Chilean Soccer Tournament.
Proceedings of the Practice and Theory of Automated Timetabling VI, 2006


  Loading...