2

The time-window strategy in the online order batching problem
When an order arrives at a warehouse it is usually assigned to a batch and a decision is made on how long to wait before assigning the …
Cite DOI
An efficient and effective GRASP algorithm for the Budget Influence Maximization Problem
Social networks are in continuous evolution, and its spreading has attracted the interest of both practitioners and the scientific …
Cite DOI
Sustainable materials acceleration platform reveals stable and efficient wide-bandgap metal halide perovskite alloys
The vast chemical space of emerging semiconductors, like metal halide perovskites, and their varied requirements for semiconductor …
Cite DOI
A reactive path relinking algorithm for solving the bi-objective p-Median and p-Dispersion problem
This paper deals with an interesting facility location problem known as the bi-objective p-Median and p-Dispersion problem (BpMD …
Cite Slides DOI URL
An iterated greedy algorithm for finding the minimum dominating set in graphs
A dominating set in a graph is a set of vertices such that every vertex outside the set is adjacent to a vertex in the set. The …
Cite DOI URL
Order Batching Problems: taxonomy and literature review
Order Batching is a family of optimization problems related to the process of picking items in a warehouse as part of supply chain …
Cite DOI URL
Variable neighborhood search approach with intensified shake for monitor placement
Several problems are emerging in the context of communication networks and most of them must be solved in reduced computing time since …
Cite DOI
A practical methodology for reproducible experimentation: an application to the Double-row Facility Layout Problem
Reproducibility of experiments is a complex task in stochastic methods such as evolutionary algorithms or metaheuristics in general. …
Cite DOI
Efficient iterated greedy for the two-dimensional bandwidth minimization problem
Graph layout problems are a family of combinatorial optimization problems that consist of finding an embedding of the vertices of an …
Cite DOI
A MILP-based heuristic algorithm for transmission expansion planning problems
In the last years, a lot of effort was placed into approximated or relaxed models and heuristic and metaheuristic algorithms to solve …
Cite DOI