( en | de | ru )

 

Disambiguation

From post

копироватьудалитьдобавить публикацию в буфер
Edge-swapping algorithms for the minimum fundamental cycle basis problem.

, , , и . Math. Methods Oper. Res., 69 (2): 205-233 (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.

Francesco Bettella

Protein secondary structure prediction using optimized scoring functions: a comparative statistical method. FU Berlin, (2009)

Francesco Pinosa

Francesco Solimena

Francesco Knechtli

Francesco Virili

 

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

Approximability of hard combinatorial optimization problems: an introduction., и . Ann. Oper. Res., 96 (1-4): 221-236 (2000)On the complexity of finding multi-constrained spanning trees., , и . Discret. Appl. Math., 5 (1): 39-50 (1983)Efficient Edge-Swapping Heuristics for Finding Minimum Fundamental Cycle Bases., , , и . WEA, том 3059 из Lecture Notes in Computer Science, стр. 14-29. Springer, (2004)On Minimum Changeover Cost Arborescences., , и . SEA, том 6630 из Lecture Notes in Computer Science, стр. 112-123. Springer, (2011)Algorithms for Finding Minimum Fundamental Cycle Bases in Graphs., , и . CTW, стр. 33-36. (2004)Solution of the Cumulative Assignment Problem With a Well-Structured Tabu Search Method., , и . J. Heuristics, 5 (2): 123-143 (1999)Subgradient Optimization, Matroid Problems and Heuristic Evaluation.. Optimization Techniques, том 41 из Lecture Notes in Computer Science, стр. 389-396. Springer, (1975)In: Alexander Schrijver, Editors, Combinatorial Optimization-Polyhedra and Efficiency or All You Wanted to Know about Polyhedral Combinatorics and Never Dared to Ask.. Eur. J. Oper. Res., 163 (1): 284-286 (2005)Fishman's sampling plan for computing network reliability., , , и . IEEE Trans. Reliability, 50 (1): 41-46 (2001)Weighted k-cardinality trees: Complexity and polyhedral structure., , , и . Networks, 24 (1): 11-21 (1994)