Lee Kyungsik

Kyungsik Lee

Information about the author Kyungsik Lee will soon be added to the site.
Found 21 papers in total
Embedded variable selection method using signomial classification
Embedded variable selection method using signomial classification
2017
We propose two variable selection methods using signomial classification. We attempt...
Computing lower bounds on basket option prices by discretizing semi-infinite linear programming
Computing lower bounds on basket option prices by discretizing semi-infinite linear programming
2016
The problem of finding static‐arbitrage bounds on basket option prices has...
Distribution-robust single-period inventory control problem with multiple unreliable suppliers
Distribution-robust single-period inventory control problem with multiple unreliable suppliers
2016
This paper presents a distribution‐robust approach to the single‐period...
Multi-class classification using a signomial function
Multi-class classification using a signomial function
2015
We propose two multi‐class classification methods using a signomial function....
Exact Algorithms for a Bandwidth Packing Problem with Queueing Delay Guarantees
Exact Algorithms for a Bandwidth Packing Problem with Queueing Delay Guarantees
2013
The bandwidth packing problem (BWP) concerns the selection of calls from a given set...
A compact formulation of the ring loading problem with integer demand splitting
A compact formulation of the ring loading problem with integer demand splitting
2009
The ring loading problem with integer demand splitting is that of routing κ...
On the convex hull of multicuts on a cycle
On the convex hull of multicuts on a cycle
2009
The minimum multicut problem on a cycle is to find a multicut on an undirected cycle...
An LP-Based Approach to the Ring Loading Problem with Integer Demand Splitting
An LP-Based Approach to the Ring Loading Problem with Integer Demand Splitting
2009
We consider the Ring Loading Problem with integer demand splitting (RLP). The problem...
An integer programming approach to packing lightpaths on WDM networks
An integer programming approach to packing lightpaths on WDM networks
2006
We consider a routing and wavelength assignment (RWA) for the efficient operation of...
Routing and wavelength assignment in survivable wavelength-division multiplexing networks without wavelength conversion
Routing and wavelength assignment in survivable wavelength-division multiplexing networks without wavelength conversion
2005
In this paper, we consider the routing and wavelength assignment problem in survivable...
A tabu search algorithm for the vehicle routing problem with time window and dock capacity constraints
A tabu search algorithm for the vehicle routing problem with time window and dock capacity constraints
2005
We consider a vehicle routing problem with time window and dock capacity constraints...
A cutting-plane generation method for a variable-capacity (0,1)-knapsack problem with general integer variables
A cutting-plane generation method for a variable-capacity (0,1)-knapsack problem with general integer variables
2004
In this paper, we propose an effective cut generation method based on the...
An integer programming approach to the subway daily crew scheduling problem
An integer programming approach to the subway daily crew scheduling problem
2002
This paper considers subway crew scheduling problem. Crew scheduling is concerned with...
A branch-and-price algorithm for the Steiner tree packing problem
A branch-and-price algorithm for the Steiner tree packing problem
2002
This paper deals with the Steiner tree packing problem. For a given undirected graph G...
Column generation approach to the Steiner tree packing problem
Column generation approach to the Steiner tree packing problem
2000
We consider the Steiner tree packing problem. For a given undirected graph G = (V,E)...
A cut generation method for the (0,1)-knapsack problem with a variable capacity
A cut generation method for the (0,1)-knapsack problem with a variable capacity
2000
In this paper, we propose a practical cut generation method based on the...
Telecommunication node clustering with node compatibility and network survivability requirements
Telecommunication node clustering with node compatibility and network survivability requirements
2000
We consider the node clustering problem that arises in designing a survivable...
Algorithm for the asynchronous transfer mode switching node location problem
Algorithm for the asynchronous transfer mode switching node location problem
1999
We consider the development of an integer programming model and algorithm for the ATM...
Lagrangian relaxation approach to the targeting problem
Lagrangian relaxation approach to the targeting problem
1999
In this paper, we consider a new weapon–target allocation problem with the...
Economic spare capacity planning for Digital Cross-Connect System mesh-restorable networks
Economic spare capacity planning for Digital Cross-Connect System mesh-restorable networks
1998
This paper considers an integer programming (IP) based optimization algorithm to solve...
An extended formulation approach to the edge-weighted maximal clique problem
An extended formulation approach to the edge-weighted maximal clique problem
1996
We consider an extended formulation approach to the edge-weighted maximal clique...
Papers per page: