Abstract
Consider the zero-one linear programming problem
such that all the data aij, bi cj are nonnegative.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
Bibliographic Notes
The effective gradient method for solving the multidimensional knapsack type zero-one programming problem has been developed by Y. Toyoda, “A simplified algorithm for obtaining approximate solutions to zero-one programming problems”, Management Science 21(1975), 1417–1427.
Author information
Authors and Affiliations
Rights and permissions
Copyright information
© 1986 Springer-Verlag Berlin Heidelberg
About this chapter
Cite this chapter
Lau, H.T. (1986). Zero-One Linear Programming. In: Combinatorial Heuristic Algorithms with FORTRAN. Lecture Notes in Economics and Mathematical Systems, vol 280. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-61649-5_2
Download citation
DOI: https://doi.org/10.1007/978-3-642-61649-5_2
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-17161-4
Online ISBN: 978-3-642-61649-5
eBook Packages: Springer Book Archive