//-->
Finding the critical path in an activity network with time-switch constraints
Yang, H.-H., (2000)
Computational comparison on the partitioning strategies in multiple choice integer programming
Lin, E.Y.H., (1996)
On geometric programming problems having negative degrees of difficulty
Bricker, D.L., (1993)