( en | de | ru )

 

Disambiguation

From post

копироватьудалитьдобавить публикацию в буфер
Efficient Edge-Swapping Heuristics for Finding Minimum Fundamental Cycle Bases.

, , , и . WEA, том 3059 из Lecture Notes in Computer Science, стр. 14-29. Springer, (2004)

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.

Leo Decker

Aufklärungspflichten über Innenprovisionen, Kick-backs und Retrozessionen bei der Kapitalanlage. Uni Tübingen, (2009)

Silke Leopold

Raphael Leonhardt

Friedrich Leonhardt

Heinz Leonhardt

 

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

The integration of Clifford Algebra in the iBP algorithm for the DMDGP., , , , и . IWBBIO, стр. 745-746. Copicentro Editorial, (2013)Preface., и . Electron. Notes Discret. Math., (2004)Improved Strategies for Branching on General Disjunctions., , и . CTW, стр. 144-145. (2009)A useful characterization of the feasible region of binary linear programs.. CTW, стр. 103-106. University of Twente, (2007)Mathematical Programming Formulations for the Bottleneck Hyperplane Clustering Problem., и . MCO, том 14 из Communications in Computer and Information Science, стр. 87-96. Springer, (2008)A New Algorithm for the KDMDGP Subclass of Distance Geometry Problems with Exact Distances., , , и . Algorithmica, 83 (8): 2400-2426 (2021)8th Cologne/Twente Workshop on Graphs and Combinatorial Optimization (CTW 2009)., , и . Discret. Appl. Math., 159 (16): 1659 (2011)Automatic Generation of Symmetry-Breaking Constraints.. COCOA, том 5165 из Lecture Notes in Computer Science, стр. 328-338. Springer, (2008)The Isomap Algorithm in Distance Geometry., и . SEA, том 75 из LIPIcs, стр. 5:1-5:13. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2017)Geometry and Analogies: A Study and Propagation Method for Word Representations., , и . SLSP, том 11816 из Lecture Notes in Computer Science, стр. 100-111. Springer, (2019)