Lee Youngho

Youngho Lee

Information about the author Youngho Lee will soon be added to the site.
Found 21 papers in total
Surrogate-RLT cuts for zero‐one integer programs
Surrogate-RLT cuts for zero‐one integer programs
2016
In this paper, we consider the class of 0–1 integer problems and develop an...
An access network design problem with end-to-end QoS constraints
An access network design problem with end-to-end QoS constraints
2014
We describe a novel nonlinear MIP modeling approach for solving an access network...
A technology mining framework in developing new wireless services
A technology mining framework in developing new wireless services
2009
In this paper, we propose a technology mining framework for mobile communication...
Tabu search heuristic algorithm for designing broadband convergence networks
Tabu search heuristic algorithm for designing broadband convergence networks
2008
In this paper, we deal with an access network design problem arising from the...
An alternative modeling for lot-sizing and scheduling problem with a decomposition based heuristic algorithm
An alternative modeling for lot-sizing and scheduling problem with a decomposition based heuristic algorithm
2007
In this paper, we consider a new lot-sizing and scheduling problem (LSSP) that...
A new reformulation approach for the generalized partial covering problem
A new reformulation approach for the generalized partial covering problem
2006
In this paper, we consider a situation in which a group of facilities must be...
A new algorithm for designing wavelength division multiplexing mesh networks
A new algorithm for designing wavelength division multiplexing mesh networks
2005
In this paper, we deal with a mesh network design problem arising from the deployment...
Partial convexification cuts for 0–1 mixed-integer programs
Partial convexification cuts for 0–1 mixed-integer programs
2005
In this research, we propose a new cut generation scheme based on constructing a...
A processor assignment problem for ATM switch configuration
A processor assignment problem for ATM switch configuration
2004
In this paper, we deal with a processor assignment problem that minimizes the total...
A new techno-economics modeling for asynchronous transfer mode based high-speed networks
A new techno-economics modeling for asynchronous transfer mode based high-speed networks
2003
This paper is concerned with a new techno-economic modeling of ATM based high-speed...
A branch-and-cut algorithm for solving an intraring synchronous optical network design problem
A branch-and-cut algorithm for solving an intraring synchronous optical network design problem
2000
In this paper, we deal with a network design problem arising from the deployment of...
Enhanced model representations for an intra-ring synchronous optical network design problem allowing demand splitting
Enhanced model representations for an intra-ring synchronous optical network design problem allowing demand splitting
2000
In this paper, we consider a network design problem arising in the context of...
New modeling approaches for the design of local access transport area networks
New modeling approaches for the design of local access transport area networks
2000
This paper is concerned with the design of a local access and transport area network...
A Lagrangian dual-based branch-and-bound algorithm for the generalized multi-assignment problem
A Lagrangian dual-based branch-and-bound algorithm for the generalized multi-assignment problem
1998
This paper develops a Lagrangian dual-based branch-and-bound algorithm for the...
A branch and cut algorithm for a Steiner tree-star problem
A branch and cut algorithm for a Steiner tree-star problem
1996
This paper deals with a Steiner tree-star problem that is a special case of the degree...
Generating cuts from surrogate constraint analysis for zero–one and multiple choice programming
Generating cuts from surrogate constraint analysis for zero–one and multiple choice programming
1997
This paper presents a new surrogate constraint analysis that gives rise to a family of...
A branch and cut algorithm for a Steiner tree-star problem
A branch and cut algorithm for a Steiner tree-star problem
1996
This paper deals with a Steiner tree-star problem that is a special case of the degree...
A hub location problem in designing digital data service networks: Lagrangian relaxation approach
A hub location problem in designing digital data service networks: Lagrangian relaxation approach
1996
This paper develops a graph-based model and a Lagrangian relaxation scheme to find a...
A simultaneous lifting strategy for identifying new classes of facets for the Boolean quadric polytope
A simultaneous lifting strategy for identifying new classes of facets for the Boolean quadric polytope
1995
The authors develop a framework for characterizing classes of facets for the Boolean...
Scheduling target illuminators in naval battle-group anti-air warfare
Scheduling target illuminators in naval battle-group anti-air warfare
1995
The authors schedule a set of illuminators (homing devices) to strike a set of targets...
Unrelated machine scheduling with time-window and machine downtime constraints: An application to a naval battle-group problem
Unrelated machine scheduling with time-window and machine downtime constraints: An application to a naval battle-group problem
1994
This paper deals with an unrelated machine scheduling problem of minimizing the total...
Papers per page: