TY  - THES
DP  - http://www.theses.fr/2015NANT2037
TI  - Bi-objective branch-and-cut algorithms applied to the binary knapsack problem : surrogate bound sets, dynamic branching strategies, generation and exploitation of cover inequalities.
AU  - Cerqueus, Audrey
A3  - Gandibleux, Xavier; Przybylski, Anthony
PY  - 2015
SP  - 1 vol. (184 p.)
N1  - Thèse de doctorat Informatique et applications Nantes 2015
N1  - 2015NANT2037
UR  - http://www.theses.fr/2015NANT2037/document
ER  -