Valid inequalities and facets for the Steiner problem in a directed graph

Valid inequalities and facets for the Steiner problem in a directed graph

0.00 Avg rating0 Votes
Article ID: iaor19972053
Country: South Korea
Volume: 21
Issue: 1
Start Page Number: 131
End Page Number: 146
Publication Date: Apr 1996
Journal: Journal of the Korean ORMS Society
Authors:
Keywords: Steiner problem
Abstract:

This paper describes the facial structure of the Steiner problem in a directed graph by formulating it as a set covering problem. It first characterizes trivial facets and derive a necessary condition for nontrivial facets. The paper also introduces a class of valid inequalities with 0-1 coefficients and show when such inequalities define facets.

Reviews

Required fields are marked *. Your email address will not be published.