Yen-I Chiang

According to our database, Yen-I Chiang authored at least 6 papers between 2001 and 2021.

Collaborative distances:

• Dijkstra number of five.
• Erdős number of three.

2021

Alternative formulations for the obnoxious <i>p</i>-median problem.

Chang-Chun Lin, Yen-I Chiang

Discret. Appl. Math., 2021

2014

Efficient model and heuristic for the intermodal terminal location problem.

Chang-Chun Lin, Yen-I Chiang, Shih-Wei Lin

Comput. Oper. Res., 2014

2011

Rough set analysis on call center metrics.

Rong-Rong Chen, Yen-I Chiang, P. Pete Chong, Yung-Hsiu Lin, Her-Kun Chang

Appl. Soft Comput., 2011

2002

A shifting algorithm for continuous tree partitioning.

Ronald I. Becker, Bruno Simeone, Yen-I Chiang

Theor. Comput. Sci., 2002

Finding the l-core of a tree.

Ronald I. Becker, Yen-I Chiang, Isabella Lari, Andrea Scozzari, Giovanni Storchi

Discret. Appl. Math., 2002

2001

The Cent-dian Path Problem on Tree Networks.

Ronald I. Becker, Yen-I Chiang, Isabella Lari, Andrea Scozzari

Proceedings of the Algorithms and Computation, 12th International Symposium, 2001