From post

Please choose a person to relate this publication to

To differ between persons with the same name, the academic degree and the title of an important publication will be displayed.

 

Другие публикации лиц с тем же именем

LP bounds in various constraint programming approaches for orthogonal packing., , и . Comput. Oper. Res., 39 (10): 2425-2438 (2012)Improved flow-based formulations for the skiving stock problem., , , , и . Comput. Oper. Res., (2020)Cutting stock problems with nondeterministic item lengths: a new approach to server consolidation., , , , и . 4OR, 17 (2): 173-200 (2019)A branch-and-bound approach for a Vehicle Routing Problem with Customer Costs., , и . EURO J. Comput. Optim., (2021)Conservative scales in packing problems., , , и . OR Spectrum, 35 (2): 505-542 (2013)An upper bound of Δ(E) < 3 / 2 for skiving stock instances of the divisible case., и . Discret. Appl. Math., (2017)An Improved Arcflow Model for the Skiving Stock Problem., , , и . OR, стр. 135-141. Springer, (2018)Solving one-dimensional cutting stock problems exactly with a cutting plane algorithm., , , и . J. Oper. Res. Soc., 52 (12): 1390-1401 (2001)Integer linear programming formulations for the minimum connectivity inference problem and model reduction principles., , , и . Discret. Optim., (2021)A Stochastic Bin Packing Approach for Server Consolidation with Conflicts., , , и . OR, стр. 159-165. Springer, (2019)