Abstract
In Chapters 14 and 15 we presented results of size-reduction techniques on sets of randomly generated and structured problems. In presenting the results, we suggested some changes which have promise for improving the performance of these techniques.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
Author information
Authors and Affiliations
Rights and permissions
Copyright information
© 1983 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Karwan, M.H., Lotfi, V., Zionts, S., Telgen, J. (1983). Improvements and Extensions. In: Redundancy in Mathematical Programming. Lecture Notes in Economics and Mathematical Systems, vol 206. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-45535-3_16
Download citation
DOI: https://doi.org/10.1007/978-3-642-45535-3_16
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-11552-6
Online ISBN: 978-3-642-45535-3
eBook Packages: Springer Book Archive