Polyhedral Results and Branch-and-Cut for the Resource Loading Problem

DOI10.1287/ijoc.2020.0957zbMath1466.90045MaRDI QIDQ4995060

Roel Leus, Tamás Kis, Guopeng Song

Publication date: 23 June 2021

Published in: INFORMS Journal on Computing (Search for Journal in Brave)

Full work available at URL: https://lirias.kuleuven.be/retrieve/541157

zbMATH Keywords

mixed integer programming; branch-and-cut; facets; capacity planning

Mathematics Subject Classification ID

90C11: Mixed integer programming

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

90C05: Linear programming

90B70: Theory of organizations, manpower planning in operations research

Uses Software

• LEMON
• RanGen