Yerim Chung
Yonsei University · 工学
研究室紹介
Professor Yerim Chung's research lab specializes in optimization and inverse problems with applications in operations research, computational mathematics, and emerging technologies. The lab focuses on developing efficient algorithms for complex decision-making problems, including bin-packing variants, vehicle-drone routing, and inverse source problems in mathematical physics. A key research direction involves understanding human experiences in immersive technologies, such as VR tourism, through psychological and behavioral modeling. The lab also investigates real-world applications of optimization in urban logistics and the impact of corporate strategies—like M&A—on consumer perception in luxury branding.
Research Overview
Research Output Trend
Figures are computed from collected data and may differ slightly.
Selected Papers
15This paper investigates whether immersive experiences (escapism and esthetic experiences) precede and influence absorptive experiences (educational and entertainment experiences) in a VR tourism setting. In addition, we examine the mediating role of flow – characterized by enjoyment, concentration, and time distortion – in the relationship between immersion and absorption. An empirical investigation was conducted using a survey of 350 participants who took part in VR tours. Partial least squares
This paper investigates the usefulness of drones in an urban delivery system. We define the vehicle and drone routing problem with time window (VDRPTW) and present a model that can describe a dual mode delivery system consisting of drones and vehicles in the metropolitan area. Drones are relatively free from traffic congestion but have limited flight range and capacity. Vehicles are not free from traffic congestion, and the complexity of urban road network reduces the efficiency of vehicles. Usi
This paper provides an algorithm for identifying the multipoles of a meromorphic function from the boundary measurements, which can be applied to inverse source problems for a Poisson equation to reconstruct its source such as linear combination of mono and dipolar point sources. After establishing an algorithm that allows to identify the number, the locations and the moments of poles, we provide a stability estimate of the algorithm under the measurement error.
In the bin-packing problem, we deal with how to pack the items by using a minimum number of bins. In the inverse bin-packing number problem, IBPN for short, we are given a list of items and a fixed number of bins. The objective is to perturb at the minimum cost the item-size vector so that all items can be packed into the prescribed number of bins. We show that IBPN is NP-hard and provide an approximation algorithm. We also consider a variant of IBPN where the prescribed solution value should be
This paper examines the effects of the mergers and acquisitions (M&A) announcement through social media on the consumer perception of the luxury brand consumption. A M&A is becoming more wide spread in the luxury market. Yet, the academic research examining the M&A in the luxury brand context has been sparse albeit the growing interests. Moreover, previous research has not paid attention to the effect of social media as a vehicle to communicate the M&A deal with consumers although social media i
In this paper we study the 0-1 inverse maximum stable set problem, denoted by I S{0, 1}. Given a graph and a fixed stable set, it is to delete the minimum number of vertices to make this stable set maximum in the new graph. We also consider I S{0, 1} against a specific algorithm such as G r e e d y and 2 o p t, aiming to delete the minimum number of vertices so that the algorithm selects the given stable set in the new graph; we denote them by I S{0, 1}, g r e e d y and I S{0, 1}, 2 o p t, respe