1.
, , . Bi-objective branch-and-cut algorithms applied to the binary knapsack problem. [[Lieu de publication inconnu]: [éditeur inconnu]; 2024.
, et . Bi-objective branch-and-cut algorithms applied to the binary knapsack problem. [Lieu de publication inconnu] : [éditeur inconnu], 2 mai 2024
Cerqueus Audrey, Gandibleux Xavier, & Przybylski Anthony. (2015). Bi-objective branch-and-cut algorithms applied to the binary knapsack problem: Surrogate bound sets, dynamic branching strategies, generation and exploitation of cover inequalities. [éditeur inconnu].
Style de citation MLA (8e éd.)Cerqueus Audrey, et al. Bi-objective Branch-and-cut Algorithms Applied to the Binary Knapsack Problem: Surrogate Bound Sets, Dynamic Branching Strategies, Generation and Exploitation of Cover Inequalities. [éditeur inconnu], 2015.
Attention : ces citations peuvent ne pas être correctes à 100%.