1 citations · 1 across the 5 of their papers we have counts for
6 papers
Solving the minimum labeling global cut problem by mathematical programming
Thiago Gouveia da Silva, Gilberto F. de Sousa Filho, Luiz Satoru Ochi +3
Let G = (V, E, L) be an edge-labeled graph such that V is the set of vertices, E is the set of edges, L is the set of labels (colors) and each edge e \in E has a label l(e) associa…
A Hybrid Heuristic for a Broad Class of Vehicle Routing Problems with Heterogeneous Fleet
Puca Huachi Vaz Penna, Anand Subramanian, Luiz Satoru Ochi +2
We consider a family of Rich Vehicle Routing Problems (RVRP) which have the particularity to combine a heterogeneous fleet with other attributes, such as backhauls, multiple depots…
Large Neighborhood-Based Metaheuristic and Branch-and-Price for the Pickup and Delivery Problem with Split Loads
Matheus Nohra Haddad, Rafael Martinelli, Thibaut Vidal +4
We consider the multi-vehicle one-to-one pickup and delivery problem with split loads, a NP-hard problem linked with a variety of applications for bulk product transportation, bike…
A study on exponential-size neighborhoods for the bin packing problem with conflicts
Renatha Capua, Yuri Frota, Luiz Satoru Ochi +1
We propose an iterated local search based on several classes of local and large neighborhoods for the bin packing problem with conflicts. This problem, which combines the character…
Large neighborhoods with implicit customer selection for vehicle routing problems with profits
Thibaut Vidal, Nelson Maculan, Puca Huachi Vaz Penna +1
We consider several Vehicle Routing Problems (VRP) with profits, which seek to select a subset of customers, each one being associated with a profit, and to design service itinerar…
On Solving Manufacturing Cell Formation via Bicluster Editing
Rian G. S. Pinheiro, Ivan C. Martins, Fábio Protti +3
This work investigates the Bicluster Graph Editing Problem (BGEP) and how it can be applied to solve the Manufacturing Cell Formation Problem (MCFP). We develop an exact method for…