This paper presents exact algorithms based on logic-based Benders decomposition and a
variant, called branch-and-check, for the heterogeneous fixed fleet vehicle routing problem …

Abstract Resource Constrained Project Scheduling Problems (RCPSPs) without preemption
are well-known N P-hard combinatorial optimization problems. A feasible RCPSP solution …

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 …

Neste trabalho, apresentamos três algoritmos enumerativos para o problema da clique
máxima ponderada. Todos eles dependem de uma ordenaçao inicial dos vértices do grafos …

Chvàtal-Gomory cuts are well-known cutting planes for Integer Programming problems. As
shown in previous works, the inclusion of these cuts allows to significantly reducing the …

Résumé In this work, we present three new exact algorithms for the maximum weight clique
problem. The three algorithms depend on an initial ordering of the vertices. Two ordering are …

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 …