Abstract
Many optimization problems are defined in a weighted graph. Generally, the criterion is min sum, i.e., the total weight of all edges in the solution; here we consider a different criterion.
Chapter PDF
Similar content being viewed by others
Author information
Authors and Affiliations
Rights and permissions
Copyright information
© 1994 Springer-Verlag Berlin · Heidelberg
About this paper
Cite this paper
Duin, C.W., Volgenant, A. (1994). The Partial Sum Criterion for Steiner Trees in Graphs and Shortest Paths. In: Operations Research Proceedings 1993. Operations Research Proceedings, vol 1993. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-78910-6_159
Download citation
DOI: https://doi.org/10.1007/978-3-642-78910-6_159
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-57862-8
Online ISBN: 978-3-642-78910-6
eBook Packages: Springer Book Archive