Abstract
A graphsack problem is a certain binary linear optimization problem with applications in optimal network design. From there a rational graphsack problem is derived by allowing the variables to vary continuously between 0 and 1. In this paper we deal with rational graphsack problems. First we develop the concept of compressed solutions and the concept of augmenting cuts. Making use of these concepts a very simple optimality criterion is derived. Finally an efficient algorithm solving rational graphsack problems is given which is polynomially bounded in time and which is closely related to the simplex algorithm.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
O. H. Ibarra, and C. E. Kim, “Fast approximation algorithms for the knapsack and sum of subset problem”,Journal of the ACM 22 (1975) 463–468.
B. Korte, “Approximative algorithms for discrete optimization problems”,Annals of Discrete Mathematics 4 (1979), 85–120.
S. Martello and P. Toth, “The 0–1 knapsack problem”, in: N. Christofides et al., eds., Combinatorial optimization, (Wiley, Chichester, 1979).
B. Rothfarb et al., “Optimal design of offshore natural gas pipeline systems”,Operations Research 18 (1970) 992–1020.
S. Sahni, “Approximative algorithms for the 0–1 knapsack problem”,Journal of the ACM 22 (1975) 115–124.
G. Tinhofer, “The graphsack problem”, in: U. Pape, ed., Discrete structures and algorithms (Carl Hanser, Müchen, 1980).
G. Tinhofer, “Über ein Problem der diskreten Optimierung aus dem Bereich der Straßenplanung”, Proceedings DGOR Jahrestagung in Essen (Springer, Berlin, 1981).
Author information
Authors and Affiliations
Rights and permissions
About this article
Cite this article
Tinhofer, G. Rational solutions of the graphsack problem. Mathematical Programming 28, 337–348 (1984). https://doi.org/10.1007/BF02612338
Received:
Revised:
Issue Date:
DOI: https://doi.org/10.1007/BF02612338