• Publications
  • Influence
Local branching
TLDR
This paper investigates the use of a generic MIP solver as a black-box ``tactical'' tool to explore effectively suitable solution subspaces defined and controlled at a ``strategic'' level by a simple external branching framework.
Heuristic and Metaheuristic Approaches for a Class of Two-Dimensional Bin Packing Problems
TLDR
A new heuristic algorithm for each problem in the class of problems arising from all combinations of the above requirements, and a unified tabu search approach that is adapted to a specific problem by simply changing the heuristic used to explore the neighborhood.
Two-dimensional packing problems: A survey
The feasibility pump
TLDR
The outcome is that FP, in spite of its simple foundation, proves competitive with ILOG-Cplex both in terms of speed and quality of the first solution delivered.
Exact Combinatorial Optimization with Graph Convolutional Neural Networks
TLDR
A new graph convolutional neural network model is proposed for learning branch-and-bound variable selection policies, which leverages the natural variable-constraint bipartite graph representation of mixed-integer linear programs.
An MILP Approach for Short-Term Hydro Scheduling and Unit Commitment With Head-Dependent Reservoir
TLDR
A model is presented that takes into account the head effects on power production through an enhanced linearization technique, and turns out to be more general and efficient than those available in the literature.
Optimizing over the first Chvátal closure
TLDR
The approach is to model the rank-1 Chvátal-Gomory separation problem through a MIP model, which is then solved through a general-purpose MIP solver, which gives a very useful separation tool for general ILP problems.
...
...