Login / Signup
Compact integer linear programming formulations for the temporal bin packing problem with fire-ups.
John Martinovic
Nico Strasdat
Maximilian Selch
Published in:
Comput. Oper. Res. (2021)
Keyphrases
</>
integer linear programming
bicriteria
column generation
linear inequalities
global constraints
lower bound
temporal information
boolean satisfiability
symmetry breaking
bin packing
temporal constraints
objective function
knapsack problem
temporal reasoning