The advances of Visual object tracking tasks in computer vision have enabled a growing
value in its application to video surveillance, particularly in a traffic scenario. In recent years …

In this paper, we propose an exact branch-price-and-cut (BPC) algorithm for the two-echelon
vehicle routing problem with time windows. This problem arises in city logistics when high …

Integer (linear) programs are a standard way of formalizing a vast array of optimization
problems in industry, services, management, science, and technology. By the logic of the …

We address the problem of accelerating column generation (CG) for set-covering
formulations via dual optimal inequalities (DOIs). We study two novel classes of DOIs, which …

The set packing problem is a core NP-complete combinatorial optimization problem which
aims to find the maximum collection of disjoint sets from a given collection of sets, S, over a …

Robots performing tasks in warehouses provide the first example of wide-spread adoption of
autonomous vehicles in transportation and logistics. The efficiency of these operations …

In this paper, we introduce a new optimization approach to Entity Resolution. Traditional
approaches tackle entity resolution with hierarchical clustering, which does not benefit from …

Column Generation (CG) is an effective and iterative algorithm to solve large-scale linear
programs (LP). During each CG iteration, new columns are added to improve the solution of …

Binary quadratic programming (BQP) is a class of combinatorial optimization problems
comprising binary variables, quadratic objective functions, and linear/nonlinear constraints …

This paper introduces a novel compact mixed integer linear programming (MILP) formulation
and a discretization discovery-based solution approach for the Vehicle Routing Problem …