Teobaldo Bulhões

Orcid: 0000-0001-9431-3750

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

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2024
A unified exact approach for a broad class of vehicle routing problems with simultaneous pickup and delivery.
Comput. Oper. Res., February, 2024

An efficient hybrid genetic algorithm for the traveling salesman problem with release dates.
Eur. J. Oper. Res., 2024

Exact and heuristic algorithms for minimizing the makespan on a single machine scheduling problem with sequence-dependent setup times and release dates.
Eur. J. Oper. Res., 2024

2023
A New Family of Route Formulations for Split Delivery Vehicle Routing Problems.
Transp. Sci., September, 2023

2022
Scheduling the Brazilian OR conference.
J. Oper. Res. Soc., 2022

Exact Approaches for Single Machine Total Weighted Tardiness Batch Scheduling.
INFORMS J. Comput., 2022

Conference scheduling: A clustering-based approach.
Eur. J. Oper. Res., 2022

2021
The biclique partitioning polytope.
Discret. Appl. Math., 2021

A hybrid algorithm for the multi-depot heterogeneous dial-a-ride problem.
Comput. Oper. Res., 2021

2020
On the exact solution of a large class of parallel machine scheduling problems.
J. Sched., 2020

2018
On the complete set packing and set partitioning polytopes: Properties and rank 1 facets.
Oper. Res. Lett., 2018

The static bike relocation problem with multiple vehicles and visits.
Eur. J. Oper. Res., 2018

The vehicle routing problem with service level constraints.
Eur. J. Oper. Res., 2018

A branch-and-price algorithm for the Minimum Latency Problem.
Comput. Oper. Res., 2018

2017
Branch-and-cut approaches for p-Cluster Editing.
Discret. Appl. Math., 2017

Branch-and-price for <i>p</i>-cluster editing.
Comput. Optim. Appl., 2017

New heuristics for the Bicluster Editing Problem.
Ann. Oper. Res., 2017

2016
A parallel hybrid metaheuristic for bicluster editing.
Int. Trans. Oper. Res., 2016


  Loading...