Can a Branch and Bound algorithm solve all instances of SALBP-1 efficiently? - Archive ouverte HAL
Article Dans Une Revue IFAC-PapersOnLine Année : 2019

Dates et versions

hal-02435977 , version 1 (12-01-2020)

Identifiants

Citer

Alexandre Dolgui, Evgeny A Gafarov. Can a Branch and Bound algorithm solve all instances of SALBP-1 efficiently?. IFAC-PapersOnLine, 2019, 52 (13), pp.2788-2791. ⟨10.1016/j.ifacol.2019.11.630⟩. ⟨hal-02435977⟩
37 Consultations
0 Téléchargements

Altmetric

Partager

More