scispace - formally typeset
Search or ask a question
Author

Kyungsik Lee

Bio: Kyungsik Lee is an academic researcher from Seoul National University. The author has contributed to research in topics: Integer programming & Column generation. The author has an hindex of 14, co-authored 67 publications receiving 674 citations. Previous affiliations of Kyungsik Lee include Hankuk University of Foreign Studies & KAIST.


Papers
More filters
Journal ArticleDOI
TL;DR: A Dantzig-Wolfe decomposition approach is proposed, which enables the uncertainty of the data to be encapsulated in the column generation subproblem, and a dynamic programming algorithm is proposed to solve the subproblem with data uncertainty.
Abstract: In this article, we investigate the vehicle routing problem with deadlines, whose goal is to satisfy the requirements of a given number of customers with minimum travel distances while respecting both of the deadlines of the customers and vehicle capacity. It is assumed that the travel time between any two customers and the demands of the customer are uncertain. Two types of uncertainty sets with adjustable parameters are considered for the possible realizations of travel time and demand. The robustness of a solution against the uncertain data can be achieved by making the solution feasible for any travel time and demand defined in the uncertainty sets. We propose a Dantzig-Wolfe decomposition approach, which enables the uncertainty of the data to be encapsulated in the column generation subproblem. A dynamic programming algorithm is proposed to solve the subproblem with data uncertainty. The results of computational experiments involving two well-known test problems show that the robustness of the solution can be greatly improved.

139 citations

Journal ArticleDOI
TL;DR: In this article, an extended formulation of the edge-weighted maximal clique problem was proposed by using additional variables for the set of nodes with the natural variables for each edge.

62 citations

Journal ArticleDOI
TL;DR: In this article, the authors considered the block scheduling problem arising in a shipyard and developed a scheduling algorithm using partial enumeration and decompostion, and an efficient heuristic search procedure for the spatial allocation of blocks was also devised.

49 citations

Journal ArticleDOI
TL;DR: An integer programming formulation of the RWAP is introduced, which has an exponential number of variables, and an algorithm to solve it based on the column generation technique is proposed, which can yield high quality solutions and tight lower bounds at the same time.
Abstract: This paper considers a routing and wavelength assignment problem (RWAP) for the implementation of efficient Wavelength Division Multiplexing all-optical mesh networks without wavelength conversion. For a given physical network and required connections, the solution to the RWAP consists in how to select a suitable path and wavelength among the many possible choices for each connection so that no two paths using the same wavelength pass through the same link, while minimizing the number of required wavelengths. We introduce an integer programming formulation of the RWAP, which has an exponential number of variables, and propose an algorithm to solve it based on the column generation technique. The proposed algorithm can yield high quality solutions and tight lower bounds at the same time. Though the proposed algorithm cannot guarantee optimal solutions, computational results show that the algorithm yields provably good solutions within a reasonable time.

47 citations

Journal ArticleDOI
TL;DR: This paper presents a two-phased train-set routing algorithm to cover a weekly train timetable with minimal working days of a minimal number of train-sets, which is an 8.8% improvement over the current routing generated by a set partitioning approach based on a path generation scheme.
Abstract: This paper presents a two-phased train-set routing algorithm to cover a weekly train timetable with minimal working days of a minimal number of train-sets. First, relax maintenance requirements and obtain minimum cost routes by solving the polynomial relaxation. Then, maintenance-feasible routes are generated from the crossovers of the minimum cost routes. This pragmatic approach seems particularly effective for the high-speed railway systems, where the railway topology is relatively simple with few end stations while the trains are frequent. Applied to the current weekly timetable of the Korea high-speed railway, we could find an optimal feasible routing, which is an 8.8% improvement over the current routing generated by a set partitioning approach based on a path generation scheme.

42 citations


Cited by
More filters
Journal ArticleDOI
TL;DR: This review comprehensively summarize recent progress that has been made in the development of small-molecule as well as material-based fluorogenic probes for sensitive detection of the activities of enzymes that are related to a number of human diseases.
Abstract: Traditional biochemical methods for enzyme detection are mainly based on antibody-based immunoassays, which lack the ability to monitor the spatiotemporal distribution and, in particular, the in situ activity of enzymes in live cells and in vivo. In this review, we comprehensively summarize recent progress that has been made in the development of small-molecule as well as material-based fluorogenic probes for sensitive detection of the activities of enzymes that are related to a number of human diseases. The principles utilized to design these probes as well as their applications are reviewed. Specific attention is given to fluorogenic probes that have been developed for analysis of the activities of enzymes including oxidases and reductases, those that act on biomacromolecules including DNAs, proteins/peptides/amino acids, carbohydrates and lipids, and those that are responsible for translational modifications. We envision that this review will serve as an ideal reference for practitioners as well as beginners in relevant research fields.

381 citations

Journal ArticleDOI
TL;DR: Based on a discussion of these streams, the IS literature's core contributions to theoretical and managerial knowledge are evaluated, and some predictions about the road that lies ahead for IS researchers are made.
Abstract: The development of the information systems (IS) literature inManagement Science during the past 50 years reflects the inception, growth, and maturation of several different research streams. The five research streams we identify incorporate different definitions of the managerial problems that relate to IS, the alternate theoretical perspectives and different methodological paradigms to study them, and the levels of the organization at which their primary results impact managerial practice. Thedecision support and design science research stream studies the application of computers in decision support, control, and managerial decision making. Thevalue of information research stream reflects relationships established based on economic analysis of information as a commodity in the management of the firm. Thehuman-computer systems design research stream emphasizes the cognitive basis for effective systems design. TheIS organization and strategy research stream focuses the level of analysis on the locus of value of the IS investment instead of on the perceptions of a system or its user. Theeconomics of information systems and technology research stream emphasizes the application of theoretical perspectives and methods from analytical and empirical economics to managerial problems involving IS and information technologies (IT). Based on a discussion of these streams, we evaluate the IS literature's core contributions to theoretical and managerial knowledge, and make some predictions about the road that lies ahead for IS researchers.

290 citations

01 Jan 2016
TL;DR: In this paper, a guide to the theory of np completeness is given for downloading computers and intractability a guide for reading good books with a cup of tea in the afternoon, instead they juggled with some harmful bugs inside their desktop computer.
Abstract: Thank you for downloading computers and intractability a guide to the theory of np completeness. As you may know, people have search numerous times for their favorite books like this computers and intractability a guide to the theory of np completeness, but end up in harmful downloads. Rather than reading a good book with a cup of tea in the afternoon, instead they juggled with some harmful bugs inside their desktop computer.

286 citations