Finding the critical path in an activity network with time-switch constraints. - Hsu-Hao Yang; Yen-Liang Chen (Eur. J. Oper. Res., 2000)

Minimization of travel time and weighted number of stops in a traffic-light network. - Yen-Liang Chen; Hsu-Hao Yang (Eur. J. Oper. Res., 2003)

Finding the first K shortest paths in a time-window network. - Yen-Liang Chen; Hsu-Hao Yang (Comput. Oper. Res., 2004)

The first K shortest unique-arc walks in a traffic-light network. - Hsu-Hao Yang; Yen-Liang Chen (Math. Comput. Model., 2004)

Finding K shortest looping paths in a traffic-light network. - Hsu-Hao Yang; Yen-Liang Chen (Comput. Oper. Res., 2005)

Visualization of machine clustering for a Taiwanese IC packaging foundry. - Hsu-Hao Yang; He-Yau Kang; Tzu-Chiang Liu (Expert Syst. Appl., 2007)

Applying rough sets to prevent customer complaints for IC packaging foundry. - Hsu-Hao Yang; Tzu-Chiang Liu; Yen-Ting Lin (Expert Syst. Appl., 2007)

On genetic algorithms for shoe making nesting - A Taiwan case. - Hsu-Hao Yang; Chien-Li Lin (Expert Syst. Appl., 2009)

Rough sets to help medical diagnosis - Evidence from a Taiwan's clinic. - Hsu-Hao Yang; Chang-Lun Wu (Expert Syst. Appl., 2009)

Measuring the efficiencies of Asia-Pacific international airports - Parametric and non-parametric evidence. - Hsu-Hao Yang (Comput. Ind. Eng., 2010)