Showing 1 - 2 of 2
-optimal inequalities (DOIs) in the context of cutting stock and bin packing problems. We generalize their results, provide new classes of … (deep) DOIs, and show the applicability to other problems (vector packing, vertex coloring, bin packing with conflicts). We … also suggest the dynamic addition of violated dual inequalities in a cutting-plane fashion and the use of dual inequalities …
Persistent link: https://www.econbiz.de/10010800842
We present two new methods to stabilize column-generation algorithms for the Temporal Knapsack Problem (TKP). Caprara et al. [Caprara A, Furini F, and Malaguti E (2013) Uncommon Dantzig-Wolfe Reformulation for the Temporal Knapsack Problem. INFORMS J. on Comp. 25(3):560–571] were the first to...
Persistent link: https://www.econbiz.de/10010961662