Add to ORKGInternational audienceThis work presents a branch-and-cut method to solve exactly the bi-objective bi-dimensional knapsack problem. Its main component is the generation of valid inequalities forbiding a set of incompatible items. We will describe the different mechanisms of our branch-and-cut (separation procedure, bound sets, generation of valid inequalities…) and experimentally validate them
International audienceThis paper focuses on branching strategies that are involved in branch and bou...
In this work, we are interested in solving multi-objective combinatorial optimization problems. Thes...
We study the knapsack problem with conflict graph (KPCG), an extension of the 0-1 knapsack problem, ...
International audienceMulti-objective multi-dimensional knapsack problems (pOmDKP) are widely used ...
We study the Knapsack Problem with Conflicts, a generalization of the Knapsack Problem in which a se...
In this paper, a reformulation that was proposed for a knapsack problem has been extended to single ...
This paper deals with the bi-objective multi-dimensional knapsack problem. We propose the adaptation...
The paper presents a new approach to significantly reduce the number of sub-problems required to ver...
The paper presents a new reformulation approach to reduce the complexity of a branch and bound algor...
After the seminal books by Martello and Toth (1990) and Kellerer, Pferschy, and Pisinger (2004), kna...
This article presents an exact cooperative method for the solution of the multidimensional knapsack ...
International audienceThis paper presents several methodological and algorithmic improvements over a...
International audienceThe paper deals with the definition and the computation of surrogate upper bou...
The bounded multiple-class binary knapsack problem is a variant of the knapsack problem where the it...
In this paper we develop a new version of the algortihm proposed in [17] for solving exactly some va...
International audienceThis paper focuses on branching strategies that are involved in branch and bou...
In this work, we are interested in solving multi-objective combinatorial optimization problems. Thes...
We study the knapsack problem with conflict graph (KPCG), an extension of the 0-1 knapsack problem, ...
International audienceMulti-objective multi-dimensional knapsack problems (pOmDKP) are widely used ...
We study the Knapsack Problem with Conflicts, a generalization of the Knapsack Problem in which a se...
In this paper, a reformulation that was proposed for a knapsack problem has been extended to single ...
This paper deals with the bi-objective multi-dimensional knapsack problem. We propose the adaptation...
The paper presents a new approach to significantly reduce the number of sub-problems required to ver...
The paper presents a new reformulation approach to reduce the complexity of a branch and bound algor...
After the seminal books by Martello and Toth (1990) and Kellerer, Pferschy, and Pisinger (2004), kna...
This article presents an exact cooperative method for the solution of the multidimensional knapsack ...
International audienceThis paper presents several methodological and algorithmic improvements over a...
International audienceThe paper deals with the definition and the computation of surrogate upper bou...
The bounded multiple-class binary knapsack problem is a variant of the knapsack problem where the it...
In this paper we develop a new version of the algortihm proposed in [17] for solving exactly some va...
International audienceThis paper focuses on branching strategies that are involved in branch and bou...
In this work, we are interested in solving multi-objective combinatorial optimization problems. Thes...
We study the knapsack problem with conflict graph (KPCG), an extension of the 0-1 knapsack problem, ...