Myung Young-Soo

Young-Soo Myung

Information about the author Young-Soo Myung will soon be added to the site.
Found 18 papers in total
An online algorithm for continuous slab caster scheduling
An online algorithm for continuous slab caster scheduling
2010
Lee et al. (2004) have introduced a slab caster scheduling problem and developed an...
Polynomial time algorithms for solving the multicommodity flow problems on two types of directed cycles
Polynomial time algorithms for solving the multicommodity flow problems on two types of directed cycles
2009
This paper considers the two kinds of integer multicommodity flow problems, a...
A survey on network survivability models
A survey on network survivability models
2008
Survivability of a network is one of the most important issues in designing...
An algorithm for the graph disconnection problem
An algorithm for the graph disconnection problem
2005
We consider the graph disconnection problem, which is to find a set of edges such that...
A cutting plane algorithm for computing k-edge survivability of a network
A cutting plane algorithm for computing k-edge survivability of a network
2004
Given an undirected network and a set of traffic demands between pairs of nodes, k...
Lower and upper bounding strategies for the network disconnection problem
Lower and upper bounding strategies for the network disconnection problem
2004
The network disconnection problem is to find a set of edges such that the total cost...
On the computational complexity of the plate stacking problem
On the computational complexity of the plate stacking problem
2003
This paper deals with a stowage plan for plates in a warehouse. This plan includes how...
The graph partition problem
The graph partition problem
2003
In this paper, we present a survey about the various graph partition problems,...
On the ring loading problem with demand splitting
On the ring loading problem with demand splitting
2004
In this paper, we improve the rerouting step of Myung, Kim and Tcha's algorithm for...
An algorithm for the preprocessing shortest path problem
An algorithm for the preprocessing shortest path problem
2002
Given a directed network, a designated arc, and lower and upper bounds for the...
An algorithm for calculating flow-based network survivability
An algorithm for calculating flow-based network survivability
2001
Survivability of a network is one of the most important issues in designing...
A faster algorithm for the ring loading problem with demand splitting
A faster algorithm for the ring loading problem with demand splitting
2001
In the ring loading problem with demand splitting, traffic demands are given for each...
A survey: Semidefinite programming, its duality, complexity and applications
A survey: Semidefinite programming, its duality, complexity and applications
2001
SDP (Semidefinite Programming), as a sort of ‘cone-LP’, optimizes a linear...
Design of communication networks with survivability constraints
Design of communication networks with survivability constraints
1999
The rapid growth of telecommunication capacity, driven in part by the wide-ranging...
Optimal load balancing on SONET rings with integer demand splitting
Optimal load balancing on SONET rings with integer demand splitting
1998
In the ring loading problem, traffic demands are given for each pair of nodes in an...
A bi-objective uncapacitated facility location problem
A bi-objective uncapacitated facility location problem
1997
We consider a bi-objective model for uncapacitated facility location where one...
Feasible region reduction cuts for the simple plant loction problem
Feasible region reduction cuts for the simple plant loction problem
1996
The authors introduce a conceptually new method of generating strong cuts for the...
Valid inequalities and facets for the Steiner problem in a directed graph
Valid inequalities and facets for the Steiner problem in a directed graph
1996
This paper describes the facial structure of the Steiner problem in a directed graph...
Papers per page: