Valid Inequalities and Facets for the Steinger Problem in a Directed Graph
In this paper, we describe the facial structure of the steiner problem in a directed graph by formulating it as a set covering problem. We first characterize trivial facets and derive a necessary condition for nontrivial facets. We also introduce a class of valid inequalities with 0-1 coefficients a...
Main Author: | Myung, Young-soo |
---|---|
Format: | Working Paper |
Language: | en_US |
Published: |
Massachusetts Institute of Technology, Operations Research Center
2004
|
Subjects: | |
Online Access: | http://hdl.handle.net/1721.1/5223 |
Similar Items
-
Steiner Wiener index of graph products
by: Yaoping Mao, et al.
Published: (2016-09-01) -
Steiner Wiener Index of Certain Windmill Graphs.
by: Herish Omer Abdullah
Published: (2023-10-01) -
On the Steiner antipodal number of graphs
by: S. Arockiaraj, et al.
Published: (2019-10-01) -
On a Combinatorial Approach to Studying the Steiner Diameter of a Graph and Its Line Graph
by: Hongfang Liu, et al.
Published: (2022-10-01) -
A Comprehensive Survey of Facet Ranking Approaches Used in Faceted Search Systems
by: Esraa Ali, et al.
Published: (2023-07-01)