Author of the publication

Optimum Solution of the Closest String Problem via Rank Distance.

, , , and . ISCO, volume 9849 of Lecture Notes in Computer Science, page 297-307. Springer, (2016)

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. You can also use the button next to the name to display some publications already assigned to the person.

 

Other publications of authors with the same name

Predicting deadlock in Store-and-Forward Networks., , and . FSTTCS, volume 338 of Lecture Notes in Computer Science, page 123-142. Springer, (1988)Competitive location and pricing on a line with metric transportation costs., , and . Eur. J. Oper. Res., 282 (1): 188-200 (2020)A Lower Bound for the Cutting Stock Problem with a Limited Number of Open Stacks., , and . CTW, page 75-78. (2009)A MIP-Based Heuristic for Pickup and Delivery on Rectilinear Layout., , , and . ICORES (Selected Papers), volume 1623 of Communications in Computer and Information Science, page 211-226. Springer, (2021)A Note on LP Relaxations for the 1D Cutting Stock Problem with Setup Costs., , and . CTW, page 181-183. University of Milan, (2008)On LP relaxations for the pattern minimization problem., , and . Networks, 57 (3): 247-253 (2011)Meta-Reasoning and Data Structuring for Improving PROLOG Programming Style., and . AIMSA, page 55-61. North-Holland, (1986)Toward Effective Response to Natural Disasters: A Data Science Approach., , , , , , and . IEEE Access, (2021)Minimum Flow Time Graph Ordering., , and . WG, volume 2880 of Lecture Notes in Computer Science, page 23-33. Springer, (2003)Optimum Solution of the Closest String Problem via Rank Distance., , , and . ISCO, volume 9849 of Lecture Notes in Computer Science, page 297-307. Springer, (2016)