default search action
Thiago F. Noronha
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2023
- [j33]Iago A. Carvalho
, Thiago F. Noronha
A fix-and-optimize heuristic for the minmax regret shortest path arborescence problem under interval uncertainty. Int. Trans. Oper. Res. 30(2): 1120-1143 (2023) - [j32]Eduardo T. Bogue, Lucas Maciel, Thiago F. Noronha
Exact algorithms for the product configuration problem. Int. Trans. Oper. Res. 30(6): 3979-3992 (2023) - 2022
- [j31]Amadeu Almeida Coco
Robust min-max regret covering problems. Comput. Optim. Appl. 83(1): 111-141 (2022) - [j30]Eduardo Theodoro Bogue, Huggo Silva Ferreira, Thiago F. Noronha
A column generation and a post optimization VNS heuristic for the vehicle routing problem with multiple time windows. Optim. Lett. 16(1): 79-95 (2022) - [j29]Iago A. Carvalho
Fix-and-optimize metaheuristics for minmax regret binary integer programming problems under interval uncertainty. RAIRO Oper. Res. 56(6): 4281-4301 (2022) - 2021
- [j28]Lucas Assunção, Andréa Cynthia Santos, Thiago F. Noronha, Rafael Andrade:
Improving logic-based Benders' algorithms for solving min-max regret problems. Oper. Res. Decis. 31(2) (2021) - [j27]Natã Goulart da Silva, Thiago F. Noronha, Martín Gómez Ravetti, Maurício C. de Souza:
The integrated uncapacitated lot sizing and bin packing problem. RAIRO Oper. Res. 55(3): 1197-1212 (2021) - [c11]Eduardo T. Bogue, Marcos V. A. Guimarães, Thiago F. Noronha, Armando Honorio Pereira, Iago A. Carvalho
The Two-Dimensional Guillotine Cutting Stock Problem with Stack Constraints. CLEI 2021: 1-9 - 2020
- [j26]Bruno Q. Pinto, Celso C. Ribeiro
A biased random-key genetic algorithm for routing and wavelength assignment under a sliding scheduled traffic model. J. Glob. Optim. 77(4): 949-973 (2020) - [i3]Lucas Assunção, Andréa Cynthia Santos, Thiago F. Noronha, Rafael Andrade:
On the Finite Optimal Convergence of Logic-Based Benders' Decomposition in Solving 0-1 Min-max Regret Optimization Problems with Interval Costs. CoRR abs/2001.00943 (2020)
2010 – 2019
- 2019
- [j25]José Maurício Costa, Pedro P. Paniago, Joaquim de Andrade, Thiago F. Noronha, Marcos Augusto M. Vieira:
Integer linear programming formulations for the variable data rate and variable channel bandwidth scheduling problem in wireless networks. Comput. Networks 165 (2019) - [j24]Daniel Morais dos Reis, Natã Goulart da Silva
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. 53(5): 1513-1528 (2019) - [i2]Iago A. Carvalho, Thiago F. Noronha, Christophe Duhamel:
Algorithms the min-max regret 0-1 Integer Linear Programming Problem with Interval Data. CoRR abs/1908.05082 (2019) - 2018
- [j23]Amadeu Almeida Coco
Formulation and algorithms for the robust maximal covering location problem. Electron. Notes Discret. Math. 64: 145-154 (2018) - [j22]Iago A. Carvalho
A MILP-based VND for the min-max regret Shortest Path Tree Problem with interval costs. Electron. Notes Discret. Math. 66: 39-46 (2018) - [j21]Huggo Silva Ferreira, Eduardo T. Bogue, Thiago F. Noronha, Slim Belhaiza
Variable Neighborhood Search for Vehicle Routing Problem with Multiple Time Windows. Electron. Notes Discret. Math. 66: 207-214 (2018) - [c10]Juliana Alves Pereira, Lucas Maciel, Thiago F. Noronha, Eduardo Figueiredo:
Heuristic and exact algorithms for product configuration in software product lines. SPLC 2018: 247 - 2017
- [j20]Lucas Assunção
A linear programming based heuristic framework for min-max regret combinatorial optimization problems with interval costs. Comput. Oper. Res. 81: 51-66 (2017) - [j19]Julliany S. Brandão, Thiago F. Noronha, Mauricio G. C. Resende, Celso C. Ribeiro
A biased random-key genetic algorithm for scheduling heterogeneous multi-round systems. Int. Trans. Oper. Res. 24(5): 1061-1077 (2017) - [j18]Juliana Alves Pereira
Heuristic and exact algorithms for product configuration in software product lines. Int. Trans. Oper. Res. 24(6): 1285-1306 (2017) - [j17]Amadeu Almeida Coco
Erratum to: An integer linear programming formulation and heuristics for the minmax relative regret robust shortest path problem. J. Glob. Optim. 68(2): 463-466 (2017) - [c9]Jose Ricardo Goncalves, Iago A. Carvalho
An Experimental Evaluation of the Algorithm Mean Upper Heuristic for Interval Data Min-Max Regret Combinatorial Optimization Problem. BRACIS 2017: 378-383 - 2016
- [j16]Julliany S. Brandão, Thiago F. Noronha, Celso C. Ribeiro
A biased random-key genetic algorithm to maximize the number of accepted lightpaths in WDM optical networks. J. Glob. Optim. 65(4): 813-835 (2016) - [c8]Lucas Assunção, Andréa Cynthia Santos
On the Finite Optimal Convergence of Logic-Based Benders' Decomposition in Solving 0-1 Min-Max Regret Optimization Problems with Interval Costs. ISCO 2016: 1-12 - [i1]Lucas Assunção, Thiago F. Noronha, Andréa Cynthia Santos, Rafael Andrade:
A linear programming based heuristic framework for min-max regret combinatorial optimization problems with interval costs. CoRR abs/1609.09179 (2016) - 2015
- [j15]Ramon Lopes, Vinicius W. C. Morais, Thiago F. Noronha, Vitor A. A. Souza:
Heuristics and matheuristics for a real-life machine reassignment problem. Int. Trans. Oper. Res. 22(1): 77-95 (2015) - [j14]Julliany S. Brandão, Thiago F. Noronha, Mauricio G. C. Resende, Celso C. Ribeiro
A biased random-key genetic algorithm for single-round divisible load scheduling. Int. Trans. Oper. Res. 22(5): 823-839 (2015) - 2014
- [j13]Laura Bahiense
A branch-and-cut algorithm for the equitable coloring problem using a formulation by representatives. Discret. Appl. Math. 164: 34-46 (2014) - [j12]Vinicius W. C. Morais, Geraldo R. Mateus, Thiago F. Noronha:
Iterated local search heuristics for the Vehicle Routing Problem with Cross-Docking. Expert Syst. Appl. 41(16): 7495-7506 (2014) - [j11]Amadeu Almeida Coco
An integer linear programming formulation and heuristics for the minmax relative regret robust shortest path problem. J. Glob. Optim. 60(2): 265-287 (2014) - 2013
- [j10]Daniel Morais dos Reis, Thiago F. Noronha, Sérgio Ricardo de Souza:
Iterated Local Search for Fiber Installation in Optical Network Optimization. Electron. Notes Discret. Math. 41: 277-284 (2013) - [c7]L. F. V. Caires, Omar Paranaiba Vilela Neto
Evolutionary synthesis of robust QCA circuits. IEEE Congress on Evolutionary Computation 2013: 2802-2808 - [c6]Rodolfo C. Cavalcante, Thiago F. Noronha, Luiz Chaimowicz
Improving combinatorial auctions for multi-robot exploration. ICAR 2013: 1-6 - 2012
- [c5]Rodolfo C. Cavalcante, Thiago F. Noronha, Luiz Chaimowicz
A Local Search Approach for Improving Multi-Robot Routing in Exploration Missions. LARS/SBR 2012: 85-90 - [c4]Ramon Lopes, Tiago Januario
Minimum overhearing and transmission multicast routing protocol for sensor networks. PE-WASUN 2012: 69-76 - 2011
- [j9]Thiago F. Noronha, Mauricio G. C. Resende, Celso C. Ribeiro
A biased random-key genetic algorithm for routing and wavelength assignment. J. Glob. Optim. 50(3): 503-518 (2011) - [c3]Natã Goulart da Silva, Sérgio Ricardo de Souza, Luiz Gustavo Dias, Thiago F. Noronha:
Biased random-key genetic algorithm for fiber installation in Optical Network Optimization. IEEE Congress on Evolutionary Computation 2011: 2267-2271 - 2010
- [j8]Thiago F. Noronha, Celso C. Ribeiro
Solving diameter-constrained minimum spanning tree problems by constraint programming. Int. Trans. Oper. Res. 17(5): 653-665 (2010) - [j7]Yuri Frota, Nelson Maculan, Thiago F. Noronha, Celso C. Ribeiro
A branch-and-cut algorithm for partition coloring. Networks 55(3): 194-204 (2010)
2000 – 2009
- 2009
- [j6]Laura Bahiense
A Branch-and-Cut Algorithm for Equitable Coloring based on a Formulation by Representatives. Electron. Notes Discret. Math. 35: 347-352 (2009) - 2008
- [j5]Thiago F. Noronha, Andréa C. Santos, Celso C. Ribeiro
Constraint Programming for the Diameter Constrained Minimum Spanning Tree Problem. Electron. Notes Discret. Math. 30: 93-98 (2008) - [j4]Celso C. Ribeiro
An efficient implementation of a VNS/ILS heuristic for a real-life car sequencing problem. Eur. J. Oper. Res. 191(3): 596-611 (2008) - [j3]Celso C. Ribeiro
A hybrid heuristic for a multi-objective real-life car sequencing problem with painting and assembly line constraints. Eur. J. Oper. Res. 191(3): 981-992 (2008) - [j2]Carlos José Pereira de Lucena, Thiago F. Noronha, Celso C. Ribeiro
A multi-agent framework to build integer programming applications to playoff elimination in sports tournaments. Int. Trans. Oper. Res. 15(6): 739-753 (2008) - [c2]Thiago F. Noronha, Mauricio G. C. Resende, Celso C. Ribeiro
Efficient Implementations of Heuristics for Routing and Wavelength Assignment. WEA 2008: 169-180 - 2006
- [j1]Thiago F. Noronha, Celso C. Ribeiro
Routing and wavelength assignment by partition colouring. Eur. J. Oper. Res. 171(3): 797-810 (2006) - [c1]Thiago F. Noronha, Celso C. Ribeiro
A Branch-and-Cut Algorithm for Scheduling the Highly-Constrained Chilean Soccer Tournament. PATAT 2006: 174-186
Coauthor Index
aka: Andréa Cynthia Santos
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from ,
, and
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and
to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from .
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-12-26 01:56 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by: