Teobaldo Bulhões

According to our database, Teobaldo Bulhões authored at least 16 papers between 2016 and 2024.

Collaborative distances:

• Dijkstra number of five.
• Erdős number of three.

2024

A unified exact approach for a broad class of vehicle routing problems with simultaneous pickup and delivery.

Rafael Praxedes, Teobaldo Bulhões, Anand Subramanian, Eduardo Uchoa

Comput. Oper. Res., February, 2024

2023

A New Family of Route Formulations for Split Delivery Vehicle Routing Problems.

Isaac Balster, Teobaldo Bulhões, Pedro Munari, Artur Alves Pessoa, Ruslan Sadykov

Transp. Sci., September, 2023

2022

Scheduling the Brazilian OR conference.

Rubens Correia, Anand Subramanian, Teobaldo Bulhões, Puca Huachi Vaz Penna

J. Oper. Res. Soc., 2022

Exact Approaches for Single Machine Total Weighted Tardiness Batch Scheduling.

Artur Alves Pessoa, Teobaldo Bulhões, Vitor Nesello, Anand Subramanian

INFORMS J. Comput., 2022

Conference scheduling: A clustering-based approach.

Teobaldo Bulhões, Rubens Correia, Anand Subramanian

Eur. J. Oper. Res., 2022

2021

The biclique partitioning polytope.

Gilberto Farias de Sousa Filho, Teobaldo Bulhões, Lucídio dos Anjos F. Cabral, Luiz Satoru Ochi, Fábio Protti, Rian G. S. Pinheiro

Discret. Appl. Math., 2021

A hybrid algorithm for the multi-depot heterogeneous dial-a-ride problem.

Igor Malheiros, Rodrigo Ramalho, Bruno Passeti, Teobaldo Bulhões, Anand Subramanian

Comput. Oper. Res., 2021

2020

On the exact solution of a large class of parallel machine scheduling problems.

Teobaldo Bulhões, Ruslan Sadykov, Anand Subramanian, Eduardo Uchoa

J. Sched., 2020

2018

On the complete set packing and set partitioning polytopes: Properties and rank 1 facets.

Teobaldo Bulhões, Artur Alves Pessoa, Fábio Protti, Eduardo Uchoa

Oper. Res. Lett., 2018

The static bike relocation problem with multiple vehicles and visits.

Teobaldo L. Bulhões Júnior, Anand Subramanian, Günes Erdogan, Gilbert Laporte

Eur. J. Oper. Res., 2018

The vehicle routing problem with service level constraints.

Teobaldo Bulhões, Minh Hoàng Hà, Rafael Martinelli, Thibaut Vidal

Eur. J. Oper. Res., 2018

A branch-and-price algorithm for the Minimum Latency Problem.

Teobaldo Bulhões, Ruslan Sadykov, Eduardo Uchoa

Comput. Oper. Res., 2018

2017

Branch-and-cut approaches for p-Cluster Editing.

Teobaldo L. Bulhões Júnior, Gilberto Farias de Sousa Filho, Anand Subramanian, Lucídio dos Anjos F. Cabral

Discret. Appl. Math., 2017

Branch-and-price for <i>p</i>-cluster editing.

Teobaldo L. Bulhões Júnior, Anand Subramanian, Gilberto Farias de Sousa Filho, Lucídio dos Anjos F. Cabral

Comput. Optim. Appl., 2017

New heuristics for the Bicluster Editing Problem.

Gilberto Farias de Sousa Filho, Teobaldo L. Bulhões Júnior, Lucídio dos Anjos F. Cabral, Luiz Satoru Ochi, Fábio Protti

Ann. Oper. Res., 2017

2016

A parallel hybrid metaheuristic for bicluster editing.

Gilberto Farias de Sousa Filho, Teobaldo L. Bulhões Júnior, Lucídio dos Anjos F. Cabral, Luiz Satoru Ochi, Fábio Protti

Int. Trans. Oper. Res., 2016