PhD Seminars - Zheng (Natu) Xu and Saeideh Dehghan Nasiri
Wednesday 29 May 2013, 11:45
LT4, Management School
The two speakers for this session are: Zheng (Natu) Xu (supervisors: David Brown and Mark Stevenson) and Saeideh Dehghan Nasiri (supervisor: Adam Letchford). Natu will be the first speaker followed by Saeideh. There will be a buffet lunch at about 1pm following the seminars.
Natu’s title is:
Exploring the adoption and implementation of enterprise systems in small and medium sized companies in China: A multi-case study analysis of users and providers
This research explores: (i) how Small and Medium sized Enterprises (SMEs) in China adopt and implement Enterprise Systems (ES); and, (ii) the role played by ES providers and domestic institutions in the initiative. Prior research on ES largely adopts a survey-based approach, focuses on large Western organisations, treats ES adoption and implementation as an event, and/or considers the user perspective only. This research employs the case study method, studying 4 SME users of ES in China and two ES providers. Adoption and implementation is viewed from a process perspective while also considering the influence of institutional factors on the success of the ES initiative. Institutional theory is utilized as the primary theory to address external influences and actor network theory (ANT) is selectively employed as a secondary theory. The two theories complement each other to explain ES adoption and implementation by SMEs in China. Five generic phases to the ES adoption and implementation process are identified across the four cases. Other observations include, for example, a weak governmental influence and the strong interventionist role played by the ES provider.
Saeideh’s title is:
Compact Formulations of the Steiner Traveling Salesman Problem and Related Problems
The Steiner Travelling Salesman Problem (STSP) is a variant of the TSP that is particularly suitable when routing on real-life road networks. The standard integer programming formulations of both the TSP and STSP have an exponential number of constraints. On the other hand, several formulations of the TSP, i.e., formulations of polynomial size, are known. We adapt some of them to the STSP, and compare them both theoretically and computationally. It turns out that, just by putting the best of the formulations into the CPLEX branch-and-bound solver, one can solve instances with over 200 nodes.