The following pages link to Teobaldo Bulhões (Q505420):
Displaying 15 items.
- Branch-and-cut approaches for \(p\)-cluster editing (Q505422) (← links)
- A branch-and-price algorithm for the minimum latency problem (Q1652580) (← links)
- The vehicle routing problem with service level constraints (Q1681277) (← links)
- The static bike relocation problem with multiple vehicles and visits (Q1681499) (← links)
- New heuristics for the bicluster editing problem (Q1686528) (← links)
- Branch-and-price for \(p\)-cluster editing (Q2013143) (← links)
- The biclique partitioning polytope (Q2032987) (← links)
- On the exact solution of a large class of parallel machine scheduling problems (Q2197322) (← links)
- Conference scheduling: a clustering-based approach (Q2242187) (← links)
- On the complete set packing and set partitioning polytopes: properties and rank 1 facets (Q2417173) (← links)
- A hybrid algorithm for the multi-depot heterogeneous dial-a-ride problem (Q2668616) (← links)
- A parallel hybrid metaheuristic for bicluster editing (Q2811935) (← links)
- Exact Approaches for Single Machine Total Weighted Tardiness Batch Scheduling (Q5087720) (← links)
- A unified exact approach for a broad class of vehicle routing problems with simultaneous pickup and delivery (Q6551059) (← links)
- Exact and heuristic algorithms for minimizing the makespan on a single machine scheduling problem with sequence-dependent setup times and release dates (Q6554640) (← links)
