( en | de | ru )

 

Disambiguation

From post

копироватьудалитьдобавить публикацию в буфер
A Lower Bound for the Cutting Stock Problem with a Limited Number of Open Stacks.

, , и . CTW, стр. 75-78. (2009)

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.

Claudio Meiss

Claudio Wilmanns

Paoloni Claudio

Claudio Puschel

Claudio Philipp

 

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

Predicting deadlock in Store-and-Forward Networks., , и . FSTTCS, том 338 из Lecture Notes in Computer Science, стр. 123-142. Springer, (1988)Competitive location and pricing on a line with metric transportation costs., , и . Eur. J. Oper. Res., 282 (1): 188-200 (2020)A Lower Bound for the Cutting Stock Problem with a Limited Number of Open Stacks., , и . CTW, стр. 75-78. (2009)A MIP-Based Heuristic for Pickup and Delivery on Rectilinear Layout., , , и . ICORES (Selected Papers), том 1623 из Communications in Computer and Information Science, стр. 211-226. Springer, (2021)Meta-Reasoning and Data Structuring for Improving PROLOG Programming Style., и . AIMSA, стр. 55-61. North-Holland, (1986)A Note on LP Relaxations for the 1D Cutting Stock Problem with Setup Costs., , и . CTW, стр. 181-183. University of Milan, (2008)On LP relaxations for the pattern minimization problem., , и . Networks, 57 (3): 247-253 (2011)Number of bins and maximum lateness minimization in two-dimensional bin packing., , и . Eur. J. Oper. Res., 291 (1): 101-113 (2021)A Primal-Dual Property of the Upper Chromatic Number of Mixed Hypergraphs.. Electron. Notes Discret. Math., (1999)A Polynomial Characterization of Some Graph Partitioning Problems.. Inf. Process. Lett., 26 (5): 223-230 (1988)