M. Fischetti. Facets of two Steiner arborescence polyhedra. Mathematical Programming, 51:401--419, 1991. Home/Search Document Not in Database Summary Related Articles Check |
This paper is cited in the following contexts:
The Fractional Prize-Collecting Steiner Tree Problem.. - Klau, Ljubic, Mutzel, .. (2003) (1 citation) (Correct)
....relate the node weighted (and thus also the prize collecting) variant to the classical Steiner tree problem. They adapt reduction techniques and show how the rooted prize collecting Steiner tree problem can be transformed into the directed version of the classical Steiner tree problem. In [7], Fischetti studies the facial structure of a generalization of the problem, the so called Steiner arborescence problem. Goemans studies the polyhedral structure of the node weighted Steiner tree problem [8] and shows that his characterization is complete in case the input graph is ....
M. Fischetti. Facets of two Steiner arborescence polyhedra. Mathematical Programming, 51:401419, 1991.
A Note on the Generalized Steiner Tree Polytope - Salazar (1999) (2 citations) (Correct)
....with the Steiner tree polytope Q(V 1 ) with Steiner node set V n V 1 . This polytope has been extensively studied in literature (see, e.g. Chopra and Rao [2, 3] Duin and Volgenant [4] Goemans [8] Goemans and Myung [9] Gr otschel, Martin and Weismantel [11] Hwang and Richards [12] Fischetti [5], amongs others, studied Steiner tree polyhedra for directed graphs. To our knowledge, there is no previous work on the GST polytope. Fischetti, Salazar and Toth [6] present a polyhedral analysis of a related polytope where the tree requirement is replaced by a cycle requirement . The paper is ....
M. Fischetti, \Facets of two Steiner arborescence polyhedra", Mathematical Programming 51 (1991) 401-419. 8
Solving the Prize-Collecting Steiner Tree Problem - Lubic, al. (2004) Self-citation (Fischetti) (Correct)
No context found.
M. Fischetti. Facets of two Steiner arborescence polyhedra. Mathematical Programming, 51:401--419, 1991.
Combining a Memetic Algorithm with Integer.. - Klau, Ljubic.. (2004) (Correct)
No context found.
M. Fischetti. Facets of two Steiner arborescence polyhedra. Mathematical Programming, 51:401--419, 1991.
Combining a Memetic Algorithm with Integer.. - Klau, Ljubic.. (2004) (Correct)
No context found.
M. Fischetti. Facets of two Steiner arborescence polyhedra. Mathematical Programming, 51:401--419, 1991.
The Fractional Prize-Collecting Steiner Tree.. - Klau, Ljubic.. (2003) (1 citation) (Correct)
No context found.
M. Fischetti. Facets of two Steiner arborescence polyhedra. Mathematical Programming, 51:401--419, 1991.
Polyhedral Techniques in Combinatorial Optimization II.. - Aardal, van Hoesel (1995) (1 citation) (Correct)
No context found.
M. Fischetti (1991b) "Facets of two Steiner arborescence polyhedra", Mathematical Programming 51 401--419.
Polyhedral Techniques in Combinatorial Optimization II.. - Aardal, van Hoesel (1995) (1 citation) (Correct)
No context found.
M. Fischetti (1991b) "Facets of two Steiner arborescence polyhedra", Mathematical Programming 51 401--419.
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC