10 citations · 22 across the 7 of their papers we have counts for
8 papers
Valid inequalities and a branch-and-cut algorithm for the routing and spectrum allocation problem
Marcelo Bianchetti, Javier Marenco
One of the most promising solutions to deal with huge data traffic demands in large communication networks is given by flexible optical networking, in particular the flexible grid…
Optimization meets Big Data: A survey
Ricardo Di Pasquale, Javier Marenco
This paper reviews recent advances in big data optimization, providing the state-of-art of this emerging field. The main focus in this review are optimization techniques being appl…
Machine learning for improving performance in an evolutionary algorithm for minimum path with uncertain costs given by massively simulated scenarios
Ricardo Di Pasquale, Javier Marenco
In this work we introduce an implementation for which machine learning techniques helped improve the overall performance of an evolutionary algorithm for an optimization problem, n…
On the combinatorics of the 2-class classification problem
Ricardo C. Corrêa, Diego Delle Donne, Javier Marenco
A set of points is linearly separable if the convex hulls of and are disjoint, hence there exists a hyperplane separating $X_B…
General Cut-Generating Procedures for the Stable Set Polytope
Ricardo C. Corrêa, Diego Delle Donne, Ivo Koch +1
We propose general separation procedures for generating cuts for the stable set polytope, inspired by a procedure by Rossi and Smriglio and applying a lifting method by Xavier and…
Polyhedral studies of vertex coloring problems: The asymmetric representatives formulation
Victor Campos, Ricardo C. Corrêa, Diego Delle Donne +2
Despite the fact that some vertex coloring problems are polynomially solvable on certain graph classes, most of these problems are not "under control" from a polyhedral point of vi…
Topological Additive Numbering of Directed Acyclic Graphs
Javier Marenco, Marcelo Mydlarz, Daniel Severin
We propose to study a problem that arises naturally from both Topological Numbering of Directed Acyclic Graphs, and Additive Coloring (also known as Lucky Labeling). Let be a d…
The Full Strategy Minority Game
Gabriel Acosta, Inés Caridi, Sebastián Guala +1
The Full Strategy Minority Game (FSMG) is an instance of the Minority Game (MG) which includes a single copy of every potential agent. In this work, we explicitly solve the FSMG th…