Lucas Létocart
YOU?
Author Swipe
View article: Complexity of the Virtual Network Embedding with uniform demands
Complexity of the Virtual Network Embedding with uniform demands Open
We study the complexity of the Virtual Network Embedding Problem (VNE), which is the combinatorial core of several telecommunication problems related to the implementation of virtualization technologies, such as Network Slicing. VNE is to …
View article: A generic Branch-and-Cut algorithm for bi-objective binary linear programs
A generic Branch-and-Cut algorithm for bi-objective binary linear programs Open
This paper presents the first generic bi-objective binary linear branch-and-cut algorithm. Studying the impact of valid inequalities in solution and objective spaces, two cutting frameworks are proposed. The multi-point separation problem …
View article: Dantzig–Wolfe reformulations for binary quadratic problems
Dantzig–Wolfe reformulations for binary quadratic problems Open
View article: A dual ascent heuristic for obtaining a lower bound of the generalized set partitioning problem with convexity constraints
A dual ascent heuristic for obtaining a lower bound of the generalized set partitioning problem with convexity constraints Open
View article: A Julia Module for Polynomial Optimization with Complex Variables\n applied to Optimal Power Flow
A Julia Module for Polynomial Optimization with Complex Variables\n applied to Optimal Power Flow Open
Many optimization problems in power transmission networks can be formulated\nas polynomial problems with complex variables. A polynomial optimization\nproblem with complex variables consists in optimizing a real-valued polynomial\nwhose va…
View article: A Column Generation Based Heuristic for the Multicommodity-ring Vehicle Routing Problem
A Column Generation Based Heuristic for the Multicommodity-ring Vehicle Routing Problem Open
We study a new routing problem arising in City Logistics. Given a ring connecting a set of urban distribution centers (UDCs) in the outskirts of a city, the problem consists in delivering goods from virtual gates located outside the city t…
View article: Fast machine reassignment
Fast machine reassignment Open
View article: Reducing graphs in graph cut segmentation
Reducing graphs in graph cut segmentation Open
In few years, graph cuts have become a leading method for solving a wide range of problems in computer vision. Howe-ver, graph cuts involve the construction of huge graphs which sometimes do not fit in memory. Currently, most of the max-fl…