Author of the publication

Efficient Edge-Swapping Heuristics for Finding Minimum Fundamental Cycle Bases.

, , , and . WEA, volume 3059 of Lecture Notes in Computer Science, page 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. 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

Approximability of hard combinatorial optimization problems: an introduction., and . Ann. Oper. Res., 96 (1-4): 221-236 (2000)On the complexity of finding multi-constrained spanning trees., , and . Discret. Appl. Math., 5 (1): 39-50 (1983)Efficient Edge-Swapping Heuristics for Finding Minimum Fundamental Cycle Bases., , , and . WEA, volume 3059 of Lecture Notes in Computer Science, page 14-29. Springer, (2004)On Minimum Changeover Cost Arborescences., , and . SEA, volume 6630 of Lecture Notes in Computer Science, page 112-123. Springer, (2011)Exact solution of the SONET Ring Loading Problem., , and . Oper. Res. Lett., 25 (3): 119-129 (1999)A branch-and-price approach to k-clustering minimum biclique completion problem., , and . ITOR, 20 (1): 101-117 (2013)Efficient algorithms for the assignment of OVSF codes in wideband CDMA., , and . ICC, page 3055-3060. IEEE, (2002)Approximating Maximum Cut with Limited Unbalance., and . WAOA, volume 4368 of Lecture Notes in Computer Science, page 202-213. Springer, (2006)Preface., and . Electron. Notes Discret. Math., (2004)Book Reviews.. Math. Methods Oper. Res., 56 (2): 343-344 (2002)