research
∙
04/19/2021
New formulations and branch-and-cut procedures for the longest induced path problem
Given an undirected graph G=(V,E), the longest induced path problem (LIP...
share
research
∙
02/19/2021
A matheuristic approach for the b-coloring problem using integer programming and a multi-start multi-greedy randomized metaheuristic
Given a graph G=(V,E), the b-coloring problem consists in attributing a ...
research
∙
02/18/2021
Maximum weighted induced forests and trees: New formulations and a computational comparative review
Given a graph G=(V,E) with a weight w_v associated with each vertex v∈ V...
research
∙
10/03/2020
New approaches for the uncapacitated three-level lot-sizing and replenishment problem with a distribution structure
We consider the uncapacitated three-level lot-sizing and replenishment p...
research
∙
09/02/2020
An enhanced simulation-based iterated local search metaheuristic for gravity fed water distribution network design optimization
The gravity fed water distribution network design (WDND) optimization pr...
research
∙
04/08/2020
A fast and effective MIP-based heuristic for a selective and periodic inventory routing problem in reverse logistics
We consider an NP-hard selective and periodic inventory routing problem ...
research
∙
02/23/2020
