Accelerating the branch-and-price algorithm using machine learning

DOI10.1016/j.ejor.2018.05.046zbMath1403.90372MaRDI QIDQ1653391

Přemysl Šucha, Zdeněk Hanzálek, Roman Václavík, Antonín Novák

Publication date: 3 August 2018

Published in: European Journal of Operational Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.ejor.2018.05.046

zbMATH Keywords

scheduling; upper bound; machine learning; branch-and-price; pricing problem

Mathematics Subject Classification ID

90C57: Polyhedral combinatorics, branch-and-bound, branch-and-cut

68T05: Learning and adaptive systems in artificial intelligence

90B35: Deterministic scheduling theory in operations research

Uses Software

• VRP
• PMTK
• GitHub