Abstract
Bein et al. [17] have characterized activity-on-arc networks by means of a measure which is called the complexity index (CI). In the context of the discrete time-cost tradeoff problem, the complexity index has been accepted to be one key measure that affects the average computational effort for solving instances in the sense that ceteris paribus a higher complexity index results in longer run-times (see, e.g., de Reyck and Herroelen [127]).
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
© 2001 Springer Science+Business Media New York
About this chapter
Cite this chapter
Kimms, A. (2001). Computational Studies. In: Mathematical Programming and Financial Objectives for Scheduling Projects. International Series in Operations Research & Management Science, vol 38. Springer, Boston, MA. https://doi.org/10.1007/978-1-4615-1453-4_18
Download citation
DOI: https://doi.org/10.1007/978-1-4615-1453-4_18
Publisher Name: Springer, Boston, MA
Print ISBN: 978-1-4613-5561-8
Online ISBN: 978-1-4615-1453-4
eBook Packages: Springer Book Archive