Author of the publication

Vertex-Disjoint Packing of Two Steiner Trees: Polyhedra and Branch-and-Cut.

, and . IPCO, volume 1610 of Lecture Notes in Computer Science, page 439-452. Springer, (1999)

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

Column Generation Based Heuristic for a Helicopter Routing Problem., , and . WEA, volume 4007 of Lecture Notes in Computer Science, page 219-230. Springer, (2006)Vertex-Disjoint Packing of Two Steiner Trees: Polyhedra and Branch-and-Cut., and . IPCO, volume 1610 of Lecture Notes in Computer Science, page 439-452. Springer, (1999)A hybrid approach for searching in the semantic web, , and . WWW, page 374-383. ACM, (2004)Column Generation Methods for Probabilistic Logic., , and . IPCO, page 313-331. University of Waterloo Press, (1990)On the Implementation of MST-Based Heuristics for the Steiner Problem in Graphs., and . ALENEX, volume 2409 of Lecture Notes in Computer Science, page 1-15. Springer, (2002)Integrating Semantic Concept Similarity in Model-Based Web Applications., , and . WebMedia/LA-WEB, page 78-85. IEEE Computer Society, (2004)A Robust Branch-Cut-and-Price Algorithm for the Heterogeneous Fleet Vehicle Routing Problem., , and . WEA, volume 4525 of Lecture Notes in Computer Science, page 150-160. Springer, (2007)Probabilistic Satisfiability with Imprecise Probabilities., , , , and . ISIPTA, page 165-174. (1999)The Team Orienteering Problem: Formulations and Branch-Cut and Price., , and . ATMOS, volume 14 of OASIcs, page 142-155. Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik, Germany, (2010)Two Approaches for Pay-per-Use Software Construction., , , and . WECWIS, page 184-191. IEEE Computer Society, (2000)