Park Sungsoo

Sungsoo Park

Information about the author Sungsoo Park will soon be added to the site.
Found 30 papers in total
Embedded variable selection method using signomial classification
2017
We propose two variable selection methods using signomial classification. We attempt...
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
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
2009
The ring loading problem with integer demand splitting is that of routing κ...
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 ant colony optimization approach for the maximum independent set problem
2007
The ant colony optimization (ACO) is a probabilistic Meta-heuristic algorithm which...
A simulated annealing algorithm for the capacitated lot-sizing and scheduling problem under sequence-dependent setup costs and setup times
2006
In this research, the single machine capacitated lot-sizing and scheduling problem...
An integer programming approach to packing lightpaths on WDM networks
2006
We consider a routing and wavelength assignment (RWA) for the efficient operation of...
An optimization algorithm for the pickup and delivery problem with time windows
2007
The pickup and delivery problem with time windows generally involves the construction...
Comparison of wavelength requirements between two wavelength assignment methods in survivable WDM networks
2006
We consider the routing and wavelength assignment (RWA) in survivable WDM network. A...
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
2005
We consider a vehicle routing problem with time window and dock capacity constraints...
Asynchronous transfer mode: virtual path-based network design
2004
We consider the problem of designing an ATM VP-based leased line backbone network....
Algorithms for the variable sized bin packing problem
2003
In this paper, we consider the variable sized bin packing problem where the objective...
An integer programming approach to the subway daily crew scheduling problem
2002
This paper considers subway crew scheduling problem. Crew scheduling is concerned with...
The single allocation problem in the interacting three-hub network
2000
We consider the single allocation problem in the interacting three-hub network with...
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
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
2000
In this paper, we propose a practical cut generation method based on the...
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
1999
We consider the development of an integer programming model and algorithm for the ATM...
Optimality of the symmetric workload allocation in a single-server flow line system
1999
This paper provides a proof of the symmetrical allocation property (SAP), conjectured...
Lagrangian relaxation approach to the targeting problem
1999
In this paper, we consider a new weapon–target allocation problem with the...
Papers per page: